| dc.contributor | 應數系 | - |
| dc.contributor | Yu, Ming Fen | en_US |
| dc.creator (作者) | Chang, F.-H | en_US |
| dc.creator (作者) | 李陽明 | zh_TW |
| dc.creator (作者) | Chen, Young-Ming | en_US |
| dc.creator (作者) | Chia, M.-L | en_US |
| dc.date (日期) | 2014-08 | - |
| dc.date.accessioned | 4-Jun-2015 11:25:35 (UTC+8) | - |
| dc.date.available | 4-Jun-2015 11:25:35 (UTC+8) | - |
| dc.date.issued (上傳時間) | 4-Jun-2015 11:25:35 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75558 | - |
| dc.description.abstract (摘要) | All-to-all communication occurs in many important applications in parallel processing. In this paper, we study the all-to-all broadcast number (the shortest time needed to complete the all-to-all broadcast) of graphs under the assumption that: each vertex can use all of its links at the same time, and each communication link is half duplex and can carry only one message at a unit of time. We give upper and lower bounds for the all-to-all broadcast number of graphs and give formulas for the all-to-all broadcast number of trees, complete bipartite graphs and double loop networks under this model. © 2014 Elsevier B.V. All rights reserved. | - |
| dc.format.extent | 649794 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Discrete Applied Mathematics, 173, 28-34 | - |
| dc.subject (關鍵詞) | Communication; Forestry; All-to-all broadcast; All-to-all communication; Complete bipartite graphs; Double loop networks; Number of trees; Parallel processing; Tree; Upper and lower bounds; Trees (mathematics); Communication; Forestry; Mathematics; Trees | - |
| dc.title (題名) | All-to-all broadcast problem of some classes of graphs under the half duplex all-port model | - |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1016/j.dam.2014.03.014 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1016/j.dam.2014.03.014 | - |
