Fault-tolerant multicast routing in the mesh with no virtual channels

This paper addresses the problem of fault-tolerant multicast routing in wormhole-routed multicomputers. We present a new pseudo-Hamiltonian path-based routing methodology for constructing deadlock-free multicast routing algorithms requiring no virtual channels. This technique is applied to construct the first fault-tolerant multicast routing algorithm for the mesh that requires no virtual channels. Simulation results indicate that this technique results in minimal performance degradation in the presence of a large number of node and channel faults.

[1]  Ran Libeskind-Hadas,et al.  Origin-based fault-tolerant routing in the mesh , 1995, Future Gener. Comput. Syst..

[2]  Suresh Chalasani,et al.  Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks , 1995, IEEE Trans. Computers.

[3]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[4]  Kai Li,et al.  A Hypercube Shared Virtual Memory System , 1989, ICPP.

[5]  Xiaola Lin,et al.  Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers , 1994, IEEE Trans. Parallel Distributed Syst..

[6]  Hong Xu,et al.  Efficient implementation of barrier synchronization in wormhole-routed hypercube multicomputers , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[7]  Frank Thomson Leighton,et al.  Parallel Algorithms and Architectures , 1987, Lecture Notes in Computer Science.

[8]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[9]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

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

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

[12]  Yu-Chee Tseng,et al.  A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels , 1996, IEEE Trans. Parallel Distributed Syst..

[13]  Xiaola Lin,et al.  Adaptive Multicast Wormhole Routing in 2D Mesh Multicomputers , 1993, PARLE.

[14]  Andrew A. Chien,et al.  Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.

[15]  Philip K. McKinley,et al.  A dominating set model for broadcast in all-port wormhole-routed 2D mesh networks , 1994, ICS '94.

[16]  William J. Dally.  Virtual-channel flow control , 1990, ISCA '90.

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

[18]  Suresh Chalasani,et al.  Adaptive fault-tolerant wormhole routing algorithms with low virtual channel requirements , 1994, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN).

[19]  Dhabaleswar K. Panda,et al.  Global reduction in wormhole k-ary n-cube networks with multidestination exchange worms , 1995, Proceedings of 9th International Parallel Processing Symposium.

[20]  Hong Xu,et al.  Unicast-Based Multicast Communication in Wormhole-Routed Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[21]  Suresh Chalasani,et al.  Fault-Tolerant Multicast Communication for Multicomputers , 1995, ICPP.