This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
August 1994 (vol. 5 no. 8)
pp. 793-804

Multicast communication services, in which the same message is delivered from a sourcenode to an arbitrary number of destination nodes, are being provided in new-generationmulticomputers. Broadcast is a special case of multicast in which a message is deliveredto all nodes in the network. The nCUBE-2, a wormhole-routed hypercube multicomputer,provides hardware support for broadcast and a restricted form of multicast in which thedestinations form a subcube. However, the broadcast routing algorithm adopted in thenCUBE-2 is not deadlock-free. In this paper, four multicast wormhole routing strategiesfor 2-D mesh multicomputers are proposed and studied. All of the algorithms are shown to be deadlock-free. These are the first deadlock-free multicast wormhole routing algorithms ever proposed. A simulation study has been conducted that compares the performance of these multicast algorithms under dynamic network traffic conditions in a 2-D mesh. The results indicate that a dual-path routing algorithm offers performance advantages over tree-based, multipath, and fixed-path algorithms.

[1] NCUBE Co.,NCUBE 6400 Processor Manual, 1990.
[2] C. L. Seitz, J. Seizovic, and W.-K. Su, "The C programmers abbreviated guide to multicomputer programming," Caltech Comput. Sci., Tech. Rep. Caltech-CS-Tr-88-1, Jan. 1988.
[3] R. F. DeMara and D. I. Moldovan, "Performance indices for parallel marker-propagation," inProc. 1991 Int. Conf. Parallel Processing, 1991, pp. 658-659.
[4] V. Kumar and V. Singh, "Scalability of parallel algorithms for the allpairs shortest path problem," Tech. Rep. ACT-OODS-058-90, Rev. 1, MCC, 1991.
[5] 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.
[6] 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.
[7] M. Metcalf and J. Reid,Fortran 90 Explained. Oxford: Oxford Univ. Press, 1990.
[8] K. Li and R. Schaefer, "A hypercube shared virtual memory," inProc. 1989 Int. Conf. Parallel Processing, vol. I, 1989, pp. 125-132.
[9] X. Lin and L. M. Ni, "Multicast communication in multicomputers networks," inProc. 1990 Int. Conf. Parallel Processing, vol. III, 1990, pp. 114-118.
[10] 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.
[11] Intel Corp.,A Touchstone DELTA Syst.Description, 1991.
[12] P. Kermani and L. Kleinrock, "Virtual cut-through: A new computer communication switching technique,"Comput. Networks, vol. 3, no. 4, pp. 267-286, 1979.
[13] W. J. Dally and C. L. Seitz, "The torus routing chip,"J. Distrib. Computing, vol. 1, no. 3, pp. 187-196, 1986.
[14] 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.
[15] W. C. Athas and C. L. Seitz, "Multicomputers: Message-passing concurrent computers,"IEEE Comput., pp. 9-25, Aug. 1988.
[16] L. M. Ni and P. K. McKinley, "A survey of wormhole routing techniques in direct networks,"IEEE Comput., vol. 26, pp. 62-76, Feb. 1993.
[17] Y. Lan, A. H. Esfahanian, and L. M. Ni, "Multicast in hypercube multiprocessors,"J. Parallel Distributed Comput., pp. 30-41, Jan. 1990.
[18] G. T. Byrd, N. P. Saraiya, and B. A. Delagi, "Multicast communication in multiprocessor systems," inProc. 1989 Int. Conf. Parallel Processing, 1989, pp. I-196-I-200.
[19] 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.
[20] P. K. McKinley, H. Xu, A.-H. Esfahanian, and L. M. Ni, "Unicast-based multicast communication in wormhole-routed networks," inProc. 1992 Int. Conf. Parallel Processing, vol. II, pp. 10-19, Aug. 1992.
[21] H. Sulivan and T. R. Bashkov, "A large scale homogeneous, fully distributed parallel machine, I," inProc. 4th Symp. Comput. Arch., March 1977, pp. 105-117.
[22] 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.
[23] S. L. Johnsson and C.-T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, pp. 1249-1268, Sept. 1989.
[24] 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.
[25] X. Lin, P. McKinley, and L. M. Ni, "Performance evaluation of multicast wormhole routing in 2D-mesh multicomputers," inProc. 1991 Int. Conf. Parallel Processing, vol. I, Aug. 1991, pp. 435-442.
[26] W. J. Dally, "Virtual channel flow control,"IEEE Trans. Comput., vol. 3, pp. 194-205, Mar. 1992.
[27] F. Harary,Graph Theory. Reading, MA: Addison-Wesley, 1972.
[28] P. Y. Song, "Design of a network for concurrent message passing systems," M.S. thesis, Massachusetts Inst. of Technol., Dept. of Comput. Sci., 1988.
[29] H. D. Schwetman, "CSIM: A C-based, process-oriented simulation language," Tech. Rep. PP-080-85, Microelectronics and Computer Technology Corp., 1985.
[30] P. K. McKinley and C. Trefftz, "MultiSim: A tool for the study of large-scale multiprocessors," inProc. 1993 Int. Workshop on Modeling, Analysis and Simulation of Comput. and Telecommun. Networks (MASCOTS 93), 1993, pp. 57-62.
[31] A. M. Law and W. David Kelton,"Simulation Modeling and Analysis. New York: McGraw-Hill, 1982.

Index Terms:
Index Termshypercube networks; parallel architectures; digital simulation; deadlock-free multicastwormhole routing; 2-D mesh multicomputers; nCUBE-2; wormhole-routed hypercubemulticomputer; broadcast routing algorithm; simulation study; dynamic network trafficconditions; dual-path routing algorithm
Citation:
X. Lin, P.K. McKinley, L.M. Ni, "Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 8, pp. 793-804, Aug. 1994, doi:10.1109/71.298203
Usage of this product signifies your acceptance of the Terms of Use.