This Article 
 Bibliographic References 
 Add to: 
Fast Gossiping in Square Meshes/Tori with Bounded-Size Packets
April 2002 (vol. 13 no. 4)
pp. 349-358

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.

[1] D. Raviv and M. Herman, "A Unified Approach to Camera Fixation and Vision-Based Road Following," IEEE Trans. Systems, Man, and Cybernetics, vol. 24, no. 8, 1994.
[2] J.C. Bermond, L. Gargano, A.A. Rescigno, and U. Vaccaro, Fast Gossiping by Short Messages SIAM J. Computing, vol. 27, no. 4, pp. 917-941, 1998.
[3] J.-C. Bermond, L. Gargano, A.A. Rescigno, and U. Vaccaro, “Fast Gossiping by Short Messages,” Proc. Int'l Colloquium Automata, Languages, and Processing '95, pp. 135-146, 1995.
[4] A. Bagchi, E.F. Schmeichel, and S.L. Hakimi, “Sequential Information Dissemination by Packets,” Networks, vol. 22, pp. 317-333, 1992.
[5] A. Bagchi, E.F. Schmeichel, and S.L. Hakimi, “Parallel Information Dissemination by Packets,” SIAM J. Computing, vol. 23, pp. 355-372, 1994.
[6] A. Czumaj, L. Gasieniec, and A. Pelc, “Time and Cost Trade-Uffs in Gossiping,” SIAM J. Discrete Math., vol. 11, pp. 400-413, 1998.
[7] W.J. Dally, “The J-Machine: System Support for Actors,” Actors: Knowledge-Based Concurrent Computing, Hewitt and Agha, eds., 1989.
[8] W.J. Dally and P. Song, “Design of Self-Timed VLSI Multicomputer Communication Controller,” Proc. Int'l Conf. Computer Design, pp. 230-234, 1987.
[9] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Los Alamitos, Calif.: IEEE CS Press, 1997.
[10] P. Fraigniaud and E. Lazard, "Methods and Problems of Communication in Usual Networks," Discrete Applied Math., vol. 53, pp. 79-133, 1994.
[11] S. Fujita and M. Yamashita, “Fast Gossiping on Square Mesh Computers,” Information Processing Letters, vol. 48, pp. 127-130, 1993.
[12] S.M. Hedetniemi, S.T. Hedetniemi, and A. Liestman, “A Survey of Gossiping and Broadcasting in Communication Networks,” Networks, vol. 18, pp. 319-349, 1988.
[13] J. Hromkovic, R. Klasing, B. Monien, and R. Peine, “Dissemination of Information in Interconnection Networks (Broadcasting&Gossiping),” Combinatorial Network Theory, pp. 125-212, D.-Z. Du and D.F. Hsu, eds., 1996.
[14] B. Juurlink, J.F. Sibeyn, and P.S. Rao, “Gossiping on Meshes and Tori,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 6, pp. 513–525, June 1998.
[15] D.W. Krumme, “Fast Gossiping for the Hypercube,” SIAM J. Computing, vol. 21, no. 2, pp. 365-380, Apr. 1992.
[16] D.W. Krumme, G. Cybenko, and K.N. Venkataraman, “Gossiping in Minimal Time,” SIAM J. Computing, vol. 21, no. 1, pp. 111-139, Feb. 1992.
[17] M. Kaufmann and J.F. Sibeyn, “Randomized Multipacket Routing and Sorting on Meshes,” Algorithmica, vol. 17, pp. 224-244, 1997.
[18] F.C.M. Lau and S.H. Zhang, “Optimal Gossiping in Paths and Cycles,” Technical Report TR-97-10, Dept. of Computer Science, Univ. of Hong Kong, July 1997.
[19] S.L. Lillevik,“The Touchstone 30 Gigaflop DELTA prototype,” Sixth Distributed Memory Computing Conf., pp. 671-677, 1991.
[20] Networks, Routers and Transputers, M.D. May, P.W. Thompson, and P.H. Welch, eds.Amsterdam: IOS Press, 1993.
[21] P.S. Rao and G. Mouney, “Data Communications in Parallel Block Predictor-Corrector Methods for Solving ODEs,” technical report, LAAS-CNRS, France, 1995.
[22] C.L. Seitz et al., "The Architecture and Programming of the Ametak Series 2010," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 33-37, Jan. 1988.
[23] Y. J. Suh and K.G. Shin, “Efficient All-to-All Personalized Exchange in Multidimensional Torus Networks,” Proc. 27th Int'l Conf. Parallel Processing, Aug. 1998.
[24] M. Soch and P. Tvrdík, “Optimal Gossip in Noncombining 2D-Meshes,” Proc. Fourth Int'l Colloquium Structural Information Comm. Complexity (SIROCCO '97), 1997.
[25] M. Soch and P. Tvrdik, “Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 12, pp. 1252-1261, Dec. 1999.
[26] Y.J. Suh and S. Yalamanchili, “All-to-All Communication with Minimum Start-Up Costs in 2D/3D Tori and Meshes,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 5, pp. 442-458, May 1998.
[27] Y.-J. Tsai and P. McKinley, “An Extended Dominating Node Approach to Broadcast and Global Combine in Multiport Wormhole-Routed Mesh Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 1,pp. 41–58, 1997.
[28] Y.-C. Tseng, T.-H. Lin, S. Gupta, and D.K. Panda, “Bandwidth-Optimal Complete Exchange on Wormhole Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 380-396, Apr. 1997.
[29] P. Tvrdík and M. Soch, “Optimal Gossip in Store-and-Forward Noncombining 2D Tori,” Proc. EUROPAR '97, 1997.
[30] Y. Yang and J. Wang, “Efficient All-to-All Broadcast in All-Port Mesh and Torus Networks,” Proc. Int'l Symp. High Performance Computer Architecture (HPCA-5), pp. 290-299, Jan. 1999.

Index Terms:
gossiping, all-to-all broadcast, total exchange, collective communication, parallel algorithms, interconnection networks, communication optimization, scheduling
Francis C.M. Lau, Shi-Heng Zhang, "Fast Gossiping in Square Meshes/Tori with Bounded-Size Packets," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 4, pp. 349-358, April 2002, doi:10.1109/71.995815
Usage of this product signifies your acceptance of the Terms of Use.