This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Recursion-Based Broadcast Paradigm in Wormhole Routed Networks
November 2005 (vol. 16 no. 11)
pp. 1034-1052
Vincenzo Liberatore, IEEE Computer Society

Abstract—A novel broadcast technique for wormhole-routed parallel computers based on recursion is presented in this paper. It works by partitioning the interconnection graph into a number of higher-level subgraphs. Then, we identify the Transmission SubGraph (TSG) in each subgraph. Both the higher-level subgraphs and the TSGs are recursively defined, i.e., we split each level i subgraph into several level i+1 subgraphs and identify-level i+1TSGs accordingly. We first split and scatter the source message into the TSG of the original graph. Next, in each recursive round message transmissions are from lower-level TSGs to higher-level TSGs and all transmissions at the same level happen concurrently. The algorithm proceeds recursively from lower-level subgraphs to higher level subgraphs until each highest-level subgraph (a single node) gets the complete message. We have applied this general paradigm to a number of topologies including two or higher dimension mesh/torus and hypercube. Our results show considerable improvements over all other algorithms for a wide range of message sizes under both one-port and all-port models.

[1] K. Hwang, Advanced Computer Architecture: Parallelism Scalability Programmability. McGraw-Hill, 1993.
[2] Y.-C. Tseng, S.-Y. Wang, and C.-W. Ho, “Efficient Broadcasting in Wormhole-Routed Multi-computers: A Network-Partitioning Approach,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 1, pp. 44-61, Jan. 1999.
[3] S.-Y. Wang and Y.-C. Tseng, “Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori,” IEEE Trans. Computers, vol. 49, no. 3, pp. 246-258, Mar. 2000.
[4] S.L. Johnson and C.-T. Ho, “Optimum Broadcasting and Personalized Communication in Hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1249-1268, Sept. 1989.
[5] J.-C. Bermond, P. Michallon, and D. Trystram, “Broadcasting in Wraparound Meshes with Parallel Mono-Directional Link,” Parallel Computing, vol. 18, pp. 639-648, 1992.
[6] Cray T3E Scalable Parallel Processing System, Cray Research Inc., 1995.
[7] The BlueGene/L Team, “An Overview of the BlueGene/L Supercomputer,” Proc. Conf. Super Computing (SC2002), Nov. 2002.
[8] S.S. Mukherjee, P. Bannon, S. Lang, A. Spink, and D. Webb, “The Alpha 21364 Network Architecture,” IEEE MICRO, vol. 22, pp. 26-35, Jan. 2002.
[9] D.F. Robinson, P.K. Mckinley, and B.H.C. Cheng, “Optimal Multicast Communication in Wormhole-Routed Torus Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 10, pp. 1029-1042, Oct. 1995.
[10] M. Barnett, D.G. Payne, R. van de Geijn, and J. Watts, “Broadcasting on Meshes with Worm-Hole Routing,” J. Parallel and Distributed Computing, vol. 35, pp. 111-121, 1996.
[11] Y-J. Tsai and P.K. Mckinley, “A Dominating Set Model for Broadcasting in All-Port Wormhole-Routed 2D Mesh Networks,” Proc ACM Int'l Conf. Supercomputing, pp. 126-135, 1994.
[12] P.K. Mckingley, H. Xu, A.-H. Esfahanian, and L.M. Ni, “Unicast-Based Multicast Communication in Wormhole-Routed Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, pp. 1252-1265, Dec. 1994.
[13] Y.-J. Tsai and P.K. McKinley, “An Extended Dominating Node Approach to Broadcast and Global Combine in Multi-Port Wormhole-Routed Mesh Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 1, pp. 41-58, Jan. 1997.
[14] Y.-J. Tsai and P.K. McKinley, “Extended Dominating Node Broadcast in All-Port Wormhole-Routed Torus Networks,” Proc. Fifth Symp. Frontiers of Massively Parallel Computation, pp. 529-536, Feb. 1995.
[15] Y.-J. Tsai and P.K. McKinley, “A Dominating Set Model for Broadcast in Wormhole-Routed 2D Mesh Networks,” Proc. Eighth ACM Int'l Conf. Supercomputing, pp. 126-135, July 1994.
[16] Y.-J. Tsai and P.K. McKinley, “An Extended Dominating Node Approach to Collective Communication in Wormhole-Routed 2D Meshes,” Proc. IEEE Scalable High Performance Computing Conf., pp. 199-206, May 1994.
[17] Y.-J. Tsai and P.K. McKinley, “Broadcast in All-Port Wormhole-Routed 3D Mesh Networks Using Extended Dominating Sets,” Proc. 1994 Int'l Conf. Parallel and Distributed Systems, pp. 120-127, Dec. 1994.
[18] Y.-J. Tsai and P.K. McKinley, “A Broadcasting Algorithm for All-Port Wormhole-Routed Torus Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 8, pp. 876-885, Aug. 1996.
[19] A.Y. Al-Dubai and M. Ould-Khaoua, “Coded Path Routing: A New Approach to Broadcasting in 3-D Meshes,” Proc. 20th IEEE Int'l Performance, Computing and Comm. Conf. (IEEE-IPCCC'2001), pp. 155-162, Apr. 2001.
[20] L.M. Ni and P.K. McKinley, “A Survey of Wormhole Routing Techniques in Direct Networks,” Computer, vol. 26, no. 2, Feb. 1993.
[21] Y.C. Tseng, “A Dilated-Diagonal-Based Scheme for Broadcast in a Wormhole-Routed 2D Torus,” IEEE Trans. Computers, vol. 46, no. 8, pp. 947-952, Aug. 1997.
[22] C.-T. Ho and M.-Y. Kao, “Optimal Broadcasting in All-Port Wormhole-Routed Hypercubes,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 2, pp. 200-204, Feb. 1995.
[23] P.K. McKinley and C. Trefftz, “Efficient Broadcast in All-Port Wormhole Routed Hypercubes,” Proc. 1993 Int'l Conf. Parallel Processing, vol. 2, pp. 288-291, Aug. 1993.
[24] H. Ko, S. Latifi, and P.K. Srimani, “Near-Optimal Broadcast in All-Port Wormhole-Routed Hypercubes Using Error-Correcting Codes,” IEEE Trans. Computers, vol. 11, no. 3, pp. 247-260, Mar. 2000.
[25] C. Wang and C. Ku, “A Near-Optimal Broadcasting Algorithm in All-Port Wormhole-Routed Hypercubes,” Proc. Int'l Conf. Supercomputing 1995, pp. 147-153, July 1995.
[26] J. Bruck, L.D. Coster, N. Dewulf, C.-T. Ho, and R. Lauwereins, “On the Design and Implementation of Broadcast and Global Combine Operations Using Postal Model,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 3, pp. 256-265, Mar. 1996.
[27] X. Zhuang and V. Liberatore, “A Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks,” Proc. 16th Int'l Parallel and Distributed Processing Symp. (IPDPS 2002), Apr. 2002.

Index Terms:
Hypercube, massive parallel computer, mesh, one-to-all broadcast, parallel processing, torus, wormhole routing.
Citation:
Xiaotong Zhuang, Vincenzo Liberatore, "A Recursion-Based Broadcast Paradigm in Wormhole Routed Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 11, pp. 1034-1052, Nov. 2005, doi:10.1109/TPDS.2005.129
Usage of this product signifies your acceptance of the Terms of Use.