This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms
June 1998 (vol. 9 no. 6)
pp. 535-549

Abstract—We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addressed in many previously proposed wormhole multicast algorithms. We also show that deadlocks on consumption channels can be avoided by using multiple classes of consumption channels and restricting the use of consumption channels by multicast messages. We provide upper bounds for the number of consumption channels required to avoid deadlocks. In addition, we present a new multicast routing algorithm, column-path, which is based on the well-known dimension-order routing used in many multicomputers and multiprocessors. Therefore, this algorithm could be implemented in existing multicomputers with simple changes to the hardware. Using simulations, we compare the performance of the proposed column-path algorithm with the previously proposed Hamiltonian-path-based multipath and an e-cube-based multicast routing algorithms. Our results show that for multicast traffic, the column-path routing offers higher throughputs, while the multipath algorithm offers lower message latencies. Another result of our study is that the commonly implemented simplistic scheme of sending one copy of a multicast message to each of its destinations exhibits good performance provided the number of destinations is small.

[1] A. Agarwal et al., “The MIT Alewife Machine: Architecture and Performance,” Proc. Int'l Symp. Computer Architecture, pp. 2-13, June 1995.
[2] S. Balakrishnan and D.K. Panda, “Impact of Multiple Consumption Channels on Wormhole Routed k-ary n-Cube Networks,” Proc. Int'l Parallel Processing Symp., pp. 163-167, 1993.
[3] R.V. Boppana, S. Chalasani, and C.S. Raghavendra, “On Multicast Wormhole Routing in Multicomputer Networks,” Proc. Symp. Parallel and Distributed Processing, pp. 722-729, 1994.
[4] R.V. Boppana, S. Chalasani, and C.S. Raghavendra, "On Multicast Wormhole Routing in Multicomputers," manuscript, Jan. 1994.
[5] Cray T3D System Architecture Overview. Cray Research Inc., Sept. 1993.
[6] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[7] 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.
[8] 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.
[9] J. Duato,"A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks," Trans. Parallel and Distributed Systems, vol. 6, no. 9, Sept. 1995, pp. 976-987.
[10] E. Fleury and P. Fraigniaud, "Multicasting in Meshes," Proc. 1994 Int'l Conf. Parallel Processing, pp. III.151-III.158, 1994.
[11] C.-T. Ho and B. Kao, "Optimal Broadcast on Hypercubes with Wormhole and e-Cube Routings," Proc. Int'l Conf. Parallel and Distributed Systems, 1993.
[12] Paragon XP/S Product Overview. Intel Corporation, 1991.
[13] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, 1994.
[14] M. Heinrich et al. “The Stanford FLASH Multiprocessor,” Proc. 21th Int'l Symp. Computer Architecture, pp. 302-313, April 1994.
[15] 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.
[16] 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.
[17] X. Lin and L. Ni, "Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks," Proc. Int'l Symp. Computer Architecture, June 1991.
[18] Z. Liu and J. Duato, "Adaptive Unicast and Multicast in 3D Mesh Networks," Proc. 27th Hawaii Int'l Conf. System Sciences, pp. 173-82, Jan. 1994.
[19] M.D. Noakes et al., "The J-Machine Multicomputer: An Architectural Evaluation," Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 224-235, May 1993.
[20] P.K. McKinley and J.W.S. Liu, "Multicast Tree Construction in Bus-Based Networks," Comm. ACM, Vol. 33, No. 1, Jan. 1990, pp. 29-42.
[21] J.Y. Ngai and C.L. Seitz, "A Framework For Adaptive Routing in Multicomputer Networks," Proc. ACM Symp. Parallel Algorithms Architectures, 1989.
[22] L.M. Ni, "Should Scalable Parallel Computers Support Efficient Hardware Multicast?" Proc. Int'l Conf. Parallel Processing Workshop, pp. 2-7, Aug. 1995.
[23] D.K. Panda, S. Singhal, and R. Keshavan, "Multidestination Message Passing in Wormhole k-Ary n-Cube Networks with Base Routing Conformed Paths," manuscript, Dec. 1995.
[24] 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.
[25] Y.-J. Suh, B.V. Dao, J. Duato, and S. Yalamanchili, "Software Based Fault-Tolerant Oblivious Routing in Pipelined Networks," Proc. 1995 Int'l Conf. Parallel Processing, pp. I.101-I.105, Aug. 1995.

Index Terms:
Consumption channels, deadlocks, multicasts, multicomputers, routing algorithms, wormhole routing.
Citation:
Rajendra V. Boppana, Suresh Chalasani, C.s. Raghavendra, "Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 6, pp. 535-549, June 1998, doi:10.1109/71.689441
Usage of this product signifies your acceptance of the Terms of Use.