摘要： 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 Cartesian product 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 Cartesian product of graphs and give formulas for the all-to-all broadcast numbers of some classes of graphs, such as the Cartesian product of two cycles, the Cartesian product of a cycle with a complete graph of odd order, the Cartesian product of two complete graphs of odd order, and the hypercube Q2n under this model. 出版者： Elsevier B.V 出版日期： 2016-01-04 出處： Theoretical computer science, 2016-01, Vol.609, p.262-271 資源來源： Elsevier ScienceDirect Journals Complete 版權： 2015 Elsevier B.V. 識別號： ISSN: 0304-3975 識別號： EISSN: 1879-2294 識別號： DOI: 10.1016/j.tcs.2015.10.002
