Issue No. 02 - February (2002 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.983941
<p><b>Abstract</b>—All-to-all communication is one of the most dense collective communication patterns and occurs in many important applications in parallel and distributed computing. In this paper, we present a new all-to-all broadcast algorithm in multidimensional all-port mesh and torus networks. We propose a broadcast pattern which ensures a balanced traffic load in all dimensions in the network so that the all-to-all broadcast algorithm can achieve a very tight near-optimal transmission time. The algorithm also takes advantage of overlapping of message switching time and transmission time, and the total communication delay asymptotically matches the lower bound of all-to-all broadcast. Finally, the algorithm is conceptually simple and symmetrical for every message and every node so that it can be easily implemented in hardware and achieves the near-optimum in practice.</p>
Parallel computing, collective communication, all-to-all communication, all-to-all broadcast, gossip, broadcast tree, routing, interprocessor communication, mesh, torus.
J. Wang and Y. Yang, "Near-Optimal All-to-All Broadcast in Multidimensional All-Port Meshes and Tori," in IEEE Transactions on Parallel & Distributed Systems, vol. 13, no. , pp. 128-141, 2002.