This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes
July 2001 (vol. 50 no. 7)
pp. 647-659

Abstract—Multicast communication is a key issue in almost all applications that run on any parallel architecture and, hence, efficient implementation of of multicast is critical to the performance of multiprocessor machines. Multicast is implemented in parallel architectures either via software or via hardware. Software-based approaches for implementing multicast can result in high message latencies, while hardware-based schemes can greatly improve performance. Deadlock freedom in multicast communication is much more difficult to achieve resulting in more involved routing algorithms and higher startup delays. Hardware tree-based algorithms do not require these high startup delays, but do suffer from high probabilities of message blocking leading to poor performance. In this paper, we propose a new hardware tree-based routing algorithm (HTA) for multicast communication under virtual cut-through switching in k-ary n-cubes that outperforms existing software and hardware path-based multicast routing schemes. Simulation results are compared against several commonly used multicast routing algorithms and show that HTA performs extremely well under many different conditions.

[1] 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.
[2] 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.
[3] R.V. Boppana, S. Chalasani, and C.S. Raghavendra, “Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 6, pp. 535–549, June 1998.
[4] G. Byrd, R. Nakano, and B. Delagi, “A Dynamic Cut-Through Communication Protocol with Multicast,” Technical Report STAN-CS-87-1148, Stanford Univ., Aug. 1987.
[5] G. Byrd, N. Saraiya, and B. Delagi, “Multicast Communication in Multiprocessor Systems,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 196-200, Aug. 1989.
[6] J. Duato, "A new theory of deadlock-free adaptive multicast routing in wormhole networks," Symp. Parallel and Distributing Processing, pp. 64-71, 1993.
[7] A. Folkestad and C. Roche, “Deadlock Probability in Unrestricted Wormhole Routing Networks,” Proc. IEEE Int'l Conf. Comm., June 1997.
[8] P. Kermani and L. Kleinrock, “Virtual Cut-Through: A New Computer Communication Switching Technique,” Computer Networks, vol. 3, pp. 267-286, 1979.
[9] J.H. Kim, Z. Liu, and A.A. Chien, "Compressionless Routing: A Framework for Adaptive and Fault Tolerant Routing," Proc. 21st Ann. Int'l Symp. Computer Architecture, pp. 289-300, Apr. 1994.
[10] X. Lin, P. McKinley, and L. Ni, “Performance Evaluation of Multicast Worm-Hole Routing in 2D Mesh Multicomputers,” Proc. Int'l Conf. Parallel Processing, pp. 435-442, 1991.
[11] X. Lin and L.M. Ni, “Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks,” Proc. Int'l Symp. Computer Architecture, pp. 116-124, 1991.
[12] P. López, J.M. Martínez, J. Duato, and F. Petrini, “On the Reduction of Deadlock Frequency by Limiting Message Injection in Wormhole Networks,” Proc. Parallel Computer Routing and Comm. Workshop, June 1997.
[13] M.P. Malumbres, J. Duato, and J. Torrellas, “An Efficient Implementation of Tree-Based Multicast Routing in Distributed Shared-Memory Multiprocessors,” Proc. Eighth Symp. Parallel and Distributed Processing, pp. 186-189, Oct. 1996.
[14] J.M. Martínez, P. López, J. Duato, and T.M. Pinkston, “Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks,” Proc. Int'l Conf. Parallel Processing, pp. 182-189, Aug. 1997.
[15] NCUBE Co., NCUBE 6400 Processor Manual, 1990.
[16] L. Ni, “Should Scalable Parallel Computers Support Efficient Hardware Multicast,” Proc. Int'l Conf. Parallel Processing, 1995.
[17] 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.
[18] 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.
[19] F. Petrini, J. Duato, P. Lopez, and J. Martinez, “LIFE: A Limited Injection, Fully Adaptive, Recovery-Based Routing Algorithm,” Proc. Fourth Int'l Conf. High Performance Computing, Dec. 1997.
[20] T.M. Pinkston and S. Warnakulasuriya, “On Deadlocks in Interconnection Networks,” Proc. 24th Int'l Symp. Computer Architecture, June 1997.
[21] K.V. Anjan and T.M. Pinkston, An Efficient Fully Adaptive Deadlock Recovery Scheme: DISHA Proc. 22nd Int'l Symp. Computer Architecture, June 1995.
[22] K.V. Anjan and T.M. Pinkston, “An Efficient, Fully Adaptive Deadlock Recovery Scheme: Disha,” Proc. 22nd Ann. Int'l Symp. Computer Architecture, pp. 201-210, June 1995.
[23] S. Warnakulasuriya and T.M. Pinkston, “Characterization of Deadlocks in Interconnection Networks,” Proc. 11th Int'l Parallel Processing Symp., Apr. 1997.
[24] J. Yang and C. King, “Efficient Tree-Based Multicast in Wormhole-Routed 2D Meshes,” Proc. Int'l Symp. Parallel Architectures, Algorithms, and Networks, 1997.

Index Terms:
Multicast communication, path-based routing, tree-based routing, deterministic routing, adaptive routing, virtual cut-through switching.
Citation:
Dianne R. Kumar, Walid A. Najjar, Pradip K. Srimani, "A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes," IEEE Transactions on Computers, vol. 50, no. 7, pp. 647-659, July 2001, doi:10.1109/12.936232
Usage of this product signifies your acceptance of the Terms of Use.