This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes
December 1999 (vol. 10 no. 12)
pp. 1252-1261

Abstract—The main results of this paper are algorithms for time-optimal gossip of large packets in noncombining full-duplex all-port 2-D tori and meshes of any size $m\times n$. The gossip algorithms define the structure of broadcast trees and lock-step scheduling schemes for packets that make the broadcast trees time-arc-disjoint. The gossip algorithm for tori is also buffer-optimal—it requires routers with auxiliary buffers for at most three packets. The gossip algorithm for meshes requires routers with auxiliary buffers for $O(m+n)$ packets.

[1] J.-C. Bermond, T. Kodate, and S. Perennes, “Gossiping in Cayley Graphs by Packets,” Lecture Notes in Computer Science. M. Deza, R. Euler, and I. Manoussakis, eds, Springer Verlag, no. 1,120, pp. 301–315, 1995.
[2] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.
[3] 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.
[4] U. Meyer and J. Sibeyn, “Gossiping Large Packets on Full-Port Tori,” Lecture Notes in Computer Science. D. Pritchard and J. Reeve, eds., no. 1,470, pp. 1,040–1,046, 1998.
[5] U. Meyer and J. Sibeyn, “Time-Independent Gossiping on Full-Port Tori,” Technical Report MPI-I-98-1-014, Max-Planck Institut fuer Informatik, May 1998.
[6] B. Plateau and D. Trystram, “Optimal Total Exchange for a 3D Torus of Processors,” Information Processing Letters, vol. 42, no. 95-102, 1992.
[7] 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.
[8] 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.
[9] M. Soch and P. Tvrdík, “Optimal Gossip in Noncombining 2-D Meshes and Tori,” Technical Report DC-97-04, Dept. CS&E, Czech Technical Univ., Prague, Dec. 1997. Available athttp://cs.felk.cvut.czpcg.
[10] M. Soch and P. Tvrdík, “Optimal Gossip in Noncombining 2-D Tori with Constant Buffers,” Technical Report DC-98-07, Dept. CS&E, Czech Technical Univ., Prague, Oct. 1998. Available athttp://cs.felk.cvut.czpcg.

Index Terms:
All-to-all broadcast, gossip, 2D torus, 2D mesh, time-arc-disjoint broadcast trees, buffer requirements.
Citation:
Michal Soch, Pavel Tvrdík, "Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 12, pp. 1252-1261, Dec. 1999, doi:10.1109/71.819947
Usage of this product signifies your acceptance of the Terms of Use.