Fault-tolerant tree-based multicasting in mesh multicomputers

We propose a fault-tolerant tree-based multicast algorithm for 2-dimensional (2-D) meshes based on the concept of the extended safety level which is a vector associated with each node to capture fault information in the neighborhood. In this approach each destination is reached through a minimum number of hops. In order to minimize the total number of traffic steps, three heuristic strategies are proposed. This approach can be easily implemented by pipelined circuit switching (PCS). A simulation study is conducted to measure the total number of traffic steps under different strategies. Our approach is the first attempt to address the fault-tolerant tree-based multicast problem in 2-D meshes based on limited global information with a simple model and succinct information.

[1]  Jie Wu,et al.  A Limited-Global-Informatin-Based Multicasting Scheme for Faulty Hypercubes , 1995, IEEE Trans. Computers.

[2]  Sudhakar Yalamanchili,et al.  A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[3]  P. McKinley,et al.  Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers , 1992 .

[4]  Kang G. Shin,et al.  Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes , 1996, IEEE Trans. Computers.

[5]  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.

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

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

[8]  Y. Lan,et al.  Distributed multi-destination routing in hypercube multiprocessors , 1988, C3P.

[9]  Frank Harary,et al.  Graph Theory , 2016 .

[10]  Peter S. Pacheco.  Parallel programming with MPI , 1996 .

[11]  C.M. Cunningham,et al.  Fault-tolerant adaptive routing for two-dimensional meshes , 1995, Proceedings of 1995 1st IEEE Symposium on High Performance Computer Architecture.

[12]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

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

[14]  Pierre Fraigniaud,et al.  Multicasting in Meshes , 1994, 1994 International Conference on Parallel Processing Vol. 3.

[15]  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.

[16]  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.

[17]  Alain J. Martin,et al.  The architecture and programming of the Ametek series 2010 multicomputer , 1988, C3P.

[18]  Jie Wu,et al.  Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[19]  oni,et al.  Tree-Based Multicasting in Wormhole-Routed Irregular Topologies , 1998 .

[20]  William J. Dally,et al.  The J-Machine: System Support for Actors , 1988 .

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

[22]  Douglas M. Blough,et al.  Tree-based fault-tolerant multicast in multicomputer networks , 1998, Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247).

[23]  R. E. Kessler,et al.  Cray T3D: a new dimension for Cray Research , 1993, Digest of Papers. Compcon Spring.

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

[25]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[26]  Dhabaleswar K. Panda,et al.  Multicasting in Irregular Networks with Cut-Through Switches Using Tree-Based Multidestination Worms , 1997, PCRCW.

[27]  Yu-Chee Tseng,et al.  An Euler-path-based multicasting model for wormhole-routed networks with multi-destination capability , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[28]  Xiaola Lin,et al.  Multicast Communication in Multicomputer Networks , 1993, ICPP.

[29]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

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

[31]  Dhabaleswar K. PandaDept.  Issues in Designing Eecient and Practical Algorithms for Collective Communication on Wormhole-routed Systems , 1995 .