Issue No. 04 - April (2002 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.995815
<p>Gossiping is the communication problem in which each node has a unique message (token) to be transmitted to every other node. The nodes exchange their tokens by packets. A solution to the problem is judged by how many rounds of packet sending it requires. In this paper, we consider the version of the problem in which small-size packets (each carrying exactly one token) are used, the links (edges) of the network are half-duplex (only one packet can flow through a link at a time), and the nodes are all-port (a node's incident edges can all be active at the same time). This is also known as the H* model. We study the 2D square mesh and the 2D square torus. An improved, asymptotically optimal algorithm for the mesh and an optimal algorithm for the torus are presented.</p>
gossiping, all-to-all broadcast, total exchange, collective communication, parallel algorithms, interconnection networks, communication optimization, scheduling
S. Zhang and F. C. Lau, "Fast Gossiping in Square Meshes/Tori with Bounded-Size Packets," in IEEE Transactions on Parallel & Distributed Systems, vol. 13, no. , pp. 349-358, 2002.