An Euler-path-based multicasting model for wormhole-routed networks with multi-destination capability

Recently, wormhole routers with multi-destination capability have been proposed to support fast multicast in a multi-computer network. In this paper, we develop a new multicasting model for such networks based on the concept of Euler path/circuit in graph theory. The model can support multiple concurrent multicasts freely from deadlock and can be applied to any network which is Eulerian or is Eulerian after some links being removed. No virtual channels are needed. In particular, we demonstrate the potential of this model by showing its fault-tolerant capability in supporting multicasting in the currently popular torus/mesh topology of any dimension with regular fault patterns (such as single node, block, L-shape, +-shape, U-shape, and H-shape) and even irregular fault patterns. The result has improved over existing fault-tolerant routing algorithms for meshes/tori in at least one of the following aspects: the number of faults tolerable, the shape of fault patterns, the number of deactivated healthy nodes, the requirement of support of virtual channels, and the range of network topology acceptable.

[1]  Suresh Chalasani,et al.  Communication in Multicomputers with Nonconvex Faults , 1995, IEEE Trans. Computers.

[2]  Ran Libeskind-Hadas,et al.  Fault-tolerant multicast routing in the mesh with no virtual channels , 1996, Proceedings. Second International Symposium on High-Performance Computer Architecture.

[3]  Yu-Chee Tseng,et al.  Some heuristics and experiments for building a multicasting tree in a high-speed network , 1997, Proceedings High Performance Computing on the Information Superhighway. HPC Asia '97.

[4]  Chita R. Das,et al.  Fault-Tolerant Routing in Mesh Networks , 1995, International Conference on Parallel Processing.

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

[6]  Dhabaleswar K. Panda,et al.  Minimizing node contention in multiple multicast on wormhole k-ary n-cube networks , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[7]  Kenneth H. Rosen,et al.  Discrete Mathematics and its applications , 2000 .

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

[9]  Jang-Ping Sheu,et al.  A Multicast Algorithm for Hypercube Multiprocessors , 1994, Parallel Algorithms Appl..

[10]  Lionel M. Ni,et al.  Fault-tolerant wormhole routing in meshes without virtual channels , 1996, IEEE Transactions on Parallel and Distributed Systems.

[11]  ChalasaniSuresh,et al.  Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks , 1995 .

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

[13]  José Duato.  A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[14]  Yu-Chee Tseng,et al.  An Euler-path-based multicasting model for wormhole-routed networks: its applications to damaged 2D Tori and meshes , 1997, 1997 IEEE International Performance, Computing and Communications Conference.

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

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

[17]  Yu-Chee Tseng,et al.  Efficient multicast in wormhole-routed 2D mesh/torus multicomputers: a network-partitioning approach , 1996, Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96).

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

[19]  Ge-Ming Chiu,et al.  Fault-Tolerant Routing Algorithm for Meshes without Using Virtual Channels , 1998, J. Inf. Sci. Eng..

[20]  Ten-Hwang Lai,et al.  Constructing Parallel Paths Betweesn Two Subcubes , 1992, IEEE Trans. Computers.

[21]  Lionel M. Ni,et al.  Fault-tolerant routing in hypercube multicomputers using local safety information , 1996 .

[22]  John N. Tsitsiklis,et al.  Efficient Routing Schemes for Multiple Broadcasts in Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..

[23]  K.M. Al-Tawil,et al.  A survey and comparison of wormhole routing techniques in a mesh networks , 1997, IEEE Network.

[24]  C. T. Howard Ho,et al.  Efficient Multi-Packet Multicast Algorithms on Meshes with Wormhole and Dimension-Ordered Routing , 1995, ICPP.

[25]  Chung-Ta King,et al.  Turn grouping for efficient multicast in wormhole mesh networks , 1996, Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96).

[26]  José Duato,et al.  A theory of fault-tolerant routing in wormhole networks , 1994, Proceedings of 1994 International Conference on Parallel and Distributed Systems.

[27]  Lionel M. Ni,et al.  Multicast in Hypercube Multiprocessors , 1990, J. Parallel Distributed Comput..

[28]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[29]  José Duato.  A Theory of Fault-Tolerant Routing in Wormhole Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[30]  Lionel M. Ni,et al.  Adaptive routing in irregular networks using cut-through switches , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[31]  John N. Tsitsiklis,et al.  Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..