Please use this identifier to cite or link to this item:
https://ah.nccu.edu.tw/handle/140.119/75558
|
| Title: | All-to-all broadcast problem of some classes of graphs under the half duplex all-port model |
| Authors: | Chang, F.-H 李陽明 Chen, Young-Ming Chia, M.-L |
| Contributors: | 應數系 Yu, Ming Fen |
| Keywords: | 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 |
| Date: | 2014-08 |
| Issue Date: | 2015-06-04 11:25:35 (UTC+8) |
| 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. |
| Relation: | Discrete Applied Mathematics, 173, 28-34 |
| Data Type: | article |
| DOI 連結: | http://dx.doi.org/10.1016/j.dam.2014.03.014 |
| Appears in Collections: | [應用數學系] 期刊論文 |
Files in This Item:
|
All items in 學術集成 are protected by copyright, with all rights reserved.
| 社群 sharing |