This Article 
 Bibliographic References 
 Add to: 
Unicast-Based Multicast Communication in Wormhole-Routed Networks
December 1994 (vol. 5 no. 12)
pp. 1252-1265

Multicast communication, in which the same message is delivered from a source node toan arbitrary number of destination nodes, is being increasingly demanded in parallelcomputing. System supported multicast services can potentially offer improvedperformance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement multicast communication in wormhole-routed direct networks, in the absence of hardware multicast support, byexploiting the properties of the switching technology. Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic,dimension-ordered routing of unicast messages. Both algorithms can deliver a multicastmessage to m-1 destinations in [log/sub 2/ m] message passing steps, while avoidingcontention among the constituent unicast messages. Performance results ofimplementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-Dmesh are given.

[1] R. F. DeMara and D. I. Moldovan, "Performance indices for parallel marker-propagation," inProc. 1991 Int. Conf. Parallel ProcessingSt. Charles, IL, Aug. 12-17, 1991, pp. 658-659.
[2] V. Kumar and V. Singh, "Scalability of parallel algorithms for the allpairs shortest path problem," Tech. Rep. ACT-OODS-058-90, Rev. 1, MCC, Jan. 1991.
[3] P. K. McKinley, H. Xu, E. Kalns, and L. M. Ni, "ComPaSS: Efficient communication services for scalable architectures," inProc. Supercomputing'92, Nov. 1992, pp. 478-487.
[4] H. Xu, P. K. McKinley, and L. M. Ni, "Efficient implementation of barrier synchronization in wormhole-routed hypercube multicomputers,"J. Parallel Distrib. Computing, vol. 16, pp. 172-184, 1992.
[5] M. Metcalf and J. Reid,Fortran 90 Explained. Oxford: Oxford Univ. Press, 1990.
[6] K. Li and R. Schaefer, "A hypercube shared virtual memory," inProc. 1989 Int. Conf. Parallel Processing, vol. I, Aug. 1989, pp. 125-132.
[7] NCUBE Company,NCUBE 6400 Processor Manual, 1990.
[8] C. L. Seitzet al., "The architecture and programming of the Ametek Series 2010 Multicomputer," inProc. Third Conf. Hypercube Concurrent Comput. Appl., ACM, Jan. 1988, pp. 33-37.
[9] L. M. Ni and P. K. McKinley, "A survey of wormhole routing techniques in direct networks,"IEEE Comput., vdl. 26, pp. 62-76, Feb. 1993.
[10] W. J. Dally and C. L. Seitz, "The torus routing chip,"J. Distrib. Computing, vol. 1, no. 3, pp. 187-196, 1986.
[11] S. L. Johnsson and C.-T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, vol. 9, pp. 1249-1268, Sept. 1989.
[12] Intel Corp.,A Touchstone DELTA System Description, 1991.
[13] W. J. Dally, J. A. S. Fiske, J. S. Keen, R. A. Lethin, M. D. Noakes, P. R. Nuth, R. E. Davison, and G. A. Fyler, "The message-driven processor: A multicomputer processing node with efficient mechanisms,"IEEE Micro, pp. 23-39, Apr. 1992.
[14] R. Duzett and R. Buck, "An overview of thenCUBE-3 supercomputer," inProc. Frontiers'92: The 5th Symp. Frontiers of Massively Parallel Computat., Oct. 1992, pp. 458-464.
[15] X. Lin, P. K. McKinley, and L. M. Ni, "Deadlock-free multicast wormhole routing in 2-D mesh multicomputers,"IEEE Trans. Parallel Distrib. Syst., vol. 5, no. 8, pp. 793-804, Aug. 1994.
[16] C.-T. Ho and S. L. Johnsson, "Distributed routing algorithms for broadcasting and personalized communication in hypercubes," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 640-648.
[17] C. R. Jesshope, P. R. Miller, and J. T. Yantchev, "High performance communication in processor networks," inProc. 16th Annu. Int. Symp. Comput. Architecture, pp. 150-157, May 1989.
[18] D. H. Linder and J. C. Harden, "An adaptive and fault tolerant wormhole routing strategy forkary n-cubes,"IEEE Trans. Comput., vol. 40, pp. 2-12, Jan. 1991.
[19] J. Duato, "On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies," inProc. 1991 Parallel Architectures and Lang. Europe Conf. (PARLE'94), 1991.
[20] C. J. Glass and L. M. Ni, "The turn model for adaptive routing," inProc. 19th Annu. Int. Symp. Comput. Architecture, May 1992, pp. 278-287.
[21] P. Berman, L. Gravano, G.D. Pifarré, and J. L. C. Sanz, "Adaptive deadlock- and livelock-free routing with all minimal paths in torus networks," inProc. 4th Symp. Parallel Algorithms and Architectures (SPAA), 1992.
[22] W. J. Dally and H. Aoki, "Deadlock-free adaptive routing in multicomputer networks using virtual channels,"IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 466-475, Apr. 1993.
[23] X. Lin, P. K. McKinley, and L. M. Ni, "The message flow model for routing in wormhole-routed networks," inProc. 1993 Int. Conf. Parallel Processing, vol. I, pp. 294-297, 1993.
[24] W. J. Dally, "Virtual channel flow control,"IEEE Trans. Comput., vol. 3, pp. 194-205, Mar. 1992.
[25] W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[26] Y. Lan, A. H. Esfahanian, and L. M. Ni, "Multicast in hypercube multiprocessors,"J. Parallel Distributed Comput., pp. 30-41, Jan. 1990.
[27] Y. Lan, L. M. Ni, and A.-H. Esfahanian, "A VLSI router design for hypercube multiprocessors,"Integration: The VLSI J., vol. 7, pp. 103-125, 1989.
[28] Ametek Computer Research Division, Arcadia, CA,Ameket System 14, Mars System Software User's Guide Version 1.0, 1987.
[29] S. Borkar et al., "iWarp: An Integrated Solution to High Speed Parallel Computing,"Proc. Supercomputing 88, Vol. 1, CS Press, Los Alamitos, Calif., Order No. 882, pp. 330-339.
[30] D. F. Robinson, D. Judd, P. K. McKinley, and B. H. C. Cheng, "Efficient collective data distribution in all-port wormhole-routed hypercubes," inProc. Supercomputing'93, Nov. 1993, pp. 792-803.

Index Terms:
Index Termsmessage passing; hypercube networks; performance evaluation; unicast-based multicastcommunication; wormhole-routed networks; destination nodes; parallel computing;performance; functionality; global process control; n-dimensional meshes; hypercubes;dimension-ordered routing; unicast messages; message passing; nCUBE-2 hypercube;168-node Symult 2010 2-D mesh
P.K. McKinley, H. Xu, A.H. Esfahanian, L.M. Ni, "Unicast-Based Multicast Communication in Wormhole-Routed Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 12, pp. 1252-1265, Dec. 1994, doi:10.1109/71.334899
Usage of this product signifies your acceptance of the Terms of Use.