This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks
September 1995 (vol. 6 no. 9)
pp. 976-987

Abstract—A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks was proposed in [12], [16]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies were proposed. Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. A tree-like routing scheme is not suitable for hardware-supported multicast in wormhole networks because it produces many headers for each message, drastically increasing the probability of a message being blocked. A path-based multicast routing model was proposed in [25] for multicomputers with 2D-mesh and hypercube topologies. In this model, messages are not replicated at intermediate nodes. This paper develops the theoretical background for the design of deadlock-free adaptive multicast routing algorithms. This theory is valid for wormhole networks using the path-based routing model. It is also valid when messages with a single destination and multiple destinations are mixed together. The new channel dependencies produced by messages with several destinations are studied. Also, two theorems are proposed, developing conditions to verify that an adaptive multicast routing algorithm is deadlock-free, even when there are cyclic dependencies between channels. As an example, the multicast routing algorithms presented in [25] are extended, so that they can take advantage of the alternative paths offered by the network.

[1] W.C. Athas and C.L. Seitz, “Multicomputers: Message-Passing Concurrent Computers,” Computer, vol. 21, pp. 9-24, Aug. 1988.
[2] P. Berman, L. Gravano, J. Sanz, and G. Pifarre, "Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks," Proc. Fourth ACM Symp. Parallel Algorithms and Architectures, June 1992.
[3] S. Borkar, R. Cohn, G. Cox, S. Gleason, T. Gross, H.T. Kung, M. Lam, B. Moore, C. Peterson, J. Pieper, L. Rankin, P.S. Tseng, J. Sutton, J. Urbanski, and J. Webb iWarp: An Integrated Solution to High-Speed Parallel Computing, Proc. 1988 Int'l Conf. Supercomputing, pp. 330-339., IEEE CS and ACM SIGARCH, Orlando, Fla., Nov. 1988.
[4] G.T. Byrd,N.P. Saraiya,, and B.A. Delagi,“Multicast communication in multiprocessor systems,” Proc. 1989 Int’l Conf. Parallel Processing, pp. I-196-I-200, Aug. 1989.
[5] C.M. Chiang and L.M. Ni, "Multi-Address Encoding for Multicast," Proc. Parallel Computer Routing and Comm. Workshop, pp. 146-160, May 1994.
[6] A.A. Chien and J.H. Kim, "Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 268-277, May 1992.
[7] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[8] W.J. Dally and H. Aoki, "Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 466-475, Apr. 1993.
[9] W.J. Dally and C.L. Seitz,“The torus routing chip,” Distributed Comput., vol. 1, no. 3, pp. 187-196, Oct. 1986.
[10] 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.
[11] J. Duato,“On the design of deadlock-free adaptive routing algorithms for multicomputers: Theoretical aspects,” Proc. Second Europe Distributed Memory Computing Conf., Apr. 1991.
[12] J. Duato, “On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies,” Proc. Parallel Architectures and Languages Europe 91, June 1991.
[13] J. Duato,“Deadlock-free adaptive routing algorithms for multicomputers: Evaluation of a new algorithm,” Proc. Third IEEE Int’l Symp. Parallel Distributed Processing, Dec. 1991.
[14] J. Duato, "Improving the Efficiency of Virtual Channels with Time-Dependent Selection Functions," Proc. Parallel Architectures and Languages Europe, pp. 635-650, June 1992.
[15] J. Duato,“A new theory of deadlock-free adaptive multicast routing in wormhole networks,” Proc. Fifth IEEE Int’l Symp. Parallel Distributed Processing, Dec. 1993.
[16] J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,320-1,331, Dec. 1993.
[17] J. Duato,“A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks,” Proc. Int’l Conf. Parallel Processing, Aug. 1994.
[18] E. Fleury and P. Fraigniaud,“Strategies for multicasting in meshes,” Proc. Int’l Conf. Parallel Processing, Aug. 1994.
[19] P.T. Gaughan and S. Yalamanchili, “Adaptive Routing Protocols for Hypercube Interconnection Networks,” Computer, vol. 26, no. 5, pp. 12–23, May 1993.
[20] C.J. Glass and L.M. Ni, "The Turn Model for Adaptive Routing," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 278-287, May 1992.
[21] C.R. Jesshope,P.R. Miller,, and J.T. Yantchev,“High performance communications in processor networks,” Proc. 16th Ann. Int’l Symp. Comput. Architecture, May-June 1989.
[22] H.T. Kung,“Deadlock avoidance for systolic communication,” Proc. 15th Ann. Int’l Symp. Comput. Architecture, May-June 1988.
[23] Y. Lan, A.-H. Esfahanian, and L.M. Ni, "Multicast in Hypercube Multiprocessors," J. Parallel and Distributed Computing, vol. 8, pp. 30-41, Jan. 1990.
[24] X. Lin and L.M. Ni,“Multicast communication in multicomputers networks,” Proc. 1990 Int’l Conf. Parallel Processing, pp. III-114-III-118, Aug. 1990.
[25] X. Lin and L. Ni, "Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks," Proc. Int'l Symp. Computer Architecture, June 1991.
[26] X. Lin,P.K. McKinley,, and A.H. Esfahanian,“Adaptive multicast wormhole routing in 2D mesh multicomputers,” Proc. Parallel Architectures Languages Europe 93, June 1993.
[27] X. Lin,P.K. McKinley,, and L.M. Ni,“The message flow model for routing in wormhole-routed networks,” Proc. 1993 Int’l Conf. Parallel Processing, Aug. 1993.
[28] X. Lin,A.H. Esfahanian,P.K. McKinley,, and A. Burago,“Adaptive wormhole routing in hypercube multicomputers,” Proc. Fifth IEEE Int’l Symp. Parallel Distributed Processing, Dec. 1993.
[29] X. Lin and L.M. Ni, "Multicast Communication in Multicomputer Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 10, pp. 1,104-1,117, 1993.
[30] X. Lin, P.K. McKinley,, and L.M. Ni,"Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, Aug. 1994, pp. 793-804.
[31] D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
[32] Z. Liu and H. Wu,“Performance evaluation of adaptive wormhole routing in 3D mesh networks,” Proc. 26th Ann. Simulation Symp., 1993.
[33] P. López and J. Duato,“Deadlock-free adaptive routing algorithms for the 3D-torus:Limitations and solutions,” Proc. Parallel Architectures Languages Europe 93, June 1993.
[34] P.K. McKinley,H. Xu,A.H. Esfahanian,, and L.M. Ni,“Unicast-based multicast communication in wormhole-routed networks,” Proc. 1992 Int’l Conf. Parallel Processing, Aug. 1992.
[35] NCUBE Co., NCUBE 6400 Processor Manual, 1990.
[36] L.M. Ni,“Communication issues in multicomputers,” Proc. First Workshop Parallel Processing,Taiwan, pp. 52-64, Dec. 1990.
[37] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[38] D.K. Panda, S. Singal, and P. Prabhakaran, “Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme,” Proc. Parallel Computer Routing and Comm. Workshop, pp. 131–145, 1994.
[39] C.L. Seitz,J. Seizovic,, and W.K. Su,“The C programmer’s abbreviated guide to multicomputer programming,” Tech. Rep. Caltech-CS-TR-88-1, Dept. of Computer Science, California Inst. ofTech nology, Jan. 1988.

Index Terms:
Adaptive routing, deadlock avoidance, graph theory, multicast routing, multicomputers, path-based multicast, virtual channels, wormhole routing.
Citation:
José Duato, "A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 9, pp. 976-987, Sept. 1995, doi:10.1109/71.466634
Usage of this product signifies your acceptance of the Terms of Use.