A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes

Multicast communication is a key issue in almost all applications that run on any parallel architecture and, hence, efficient implementation 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]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[2]  Cauligi S. Raghavendra,et al.  Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms , 1998, IEEE Trans. Parallel Distributed Syst..

[3]  José Duato,et al.  A new theory of deadlock-free adaptive multicast routing in wormhole networks , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[4]  Timothy Mark Pinkston,et al.  An efficient, fully adaptive deadlock recovery scheme: DISHA , 1995, ISCA.

[5]  Luis Gravano,et al.  Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks , 1992, SPAA '92.

[6]  Chung-Ta King,et al.  Efficient tree-based multicast in wormhole-routed 2D meshes , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[7]  Gregory T. Byrd,et al.  Multicast Communication in Multiprocessor Systems , 1989, ICPP.

[8]  Andrew A. Chien,et al.  Compressionless routing: a framework for adaptive and fault-tolerant routing , 1994, ISCA '94.

[9]  Timothy Mark Pinkston,et al.  Characterization of deadlocks in interconnection networks , 1997, Proceedings 11th International Parallel Processing Symposium.

[10]  Arne Folkestad,et al.  Deadlock probability in unrestricted wormhole routing networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[11]  Pedro López,et al.  On the Reduction of Deadlock Frequency by Limiting Message Injection in Wormhole Networks , 1997, PCRCW.

[12]  Dhabaleswar K. Panda,et al.  Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme , 1994, PCRCW.

[13]  Cauligi S. Raghavendra,et al.  On multicast wormhole routing in multicomputer networks , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[14]  Pedro López,et al.  Software-based deadlock recovery technique for true fully adaptive routing in wormhole networks , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[15]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[16]  T.M. Pinkston,et al.  On Deadlocks In Interconnection Networks , 1997, Conference Proceedings. The 24th Annual International Symposium on Computer Architecture.

[17]  B. A. Delagi,et al.  A Dynamic, Cut-Through Communications Protocol with Multicast , 1987 .

[18]  Pedro López,et al.  LIFE: a limited injection, fully adaptive, recovery-based routing algorithm , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[19]  Xiaola Lin,et al.  Performance Evaluation of Multicast Wormhole Routing in 2D-Mesh Multicomputers , 1991, ICPP.

[20]  Lionel M. Ni,et al.  Should Scalable Parallel Computers Support Efficient Hardware Multicast , 1995 .

[21]  Josep Torrellas,et al.  An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

[22]  Timothy Mark Pinkston,et al.  On Deadlocks in Interconnection Networks , 1997, ISCA.

[23]  Xiaola Lin,et al.  Deadlock-free multicast wormhole routing in multicomputer networks , 1991, ISCA '91.

[24]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..