Broadcasting in faulty hypercubes

Abstract We propose a non-redundant broadcasting algorithm for hypercubes with faulty nodes. The concept of unsafe node is introduced to identify those non-faulty nodes that will cause a detour or backtracking because of their proximity to faulty nodes. It is assumed that each healthy node, safe or unsafe, knows the status of all the neighboring nodes. The broadcasting is optimal, namely, a message is sent to each node via Hamming distance path if the broadcasting is initiated from a safe node. We also show that when the source node is unsafe and there is an adjacent safe node then the broadcasting can be achieved with only one more time step than the fault-free case.

[1]  Jie Wu.  Fault-Tolerant Nonredundant Broadcasting in Hypercubes , 1992, ICPP.

[2]  Louis O. Hertzberger.  Parallel processing, the challenge of new computer architectures: Tim Johnson and Tony Durham , 1987, Future Gener. Comput. Syst..

[3]  Quentin F. Stout,et al.  Intensive Hypercube Communication. Prearranged Communication in Link-Bound Machines , 1990, J. Parallel Distributed Comput..

[4]  Jie Wu,et al.  A Multidestination Routing Scheme for Hypercube Multiprocessors , 1991, ICPP.

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

[6]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[7]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[8]  Subir Bandyopadhyay,et al.  Deadlock-Free Routing in k-Ary Hypercube Network in Presence of Processor Failures , 1990, Inf. Process. Lett..

[9]  Ming-Syan Chen,et al.  Depth-First Search Approach for Fault-Tolerant Routing in Hypercube , 1990, IEEE Trans. Parallel Distributed Syst..

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

[11]  Cauligi S. Raghavendra,et al.  Flexible, fault-tolerant routing criteria for circuit-switched hypercubes , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[12]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[13]  Jie Wu,et al.  Broadcasting in Faulty Cube-Connected-Cycles with Minimum Recovery Time , 1992, CONPAR.

[14]  Chung-Ta King,et al.  Parallel Algorithm Design Considerations for Hypercube Multiprocessors , 1987, ICPP.

[15]  Fred B. Schneider,et al.  Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.

[16]  Hector Garcia-Molina,et al.  Elections in a Distributed Computing System , 1982, IEEE Transactions on Computers.

[17]  John P. Hayes,et al.  A Fault-Tolerant Communication Scheme for Hypercube Computers , 1992, IEEE Trans. Computers.

[18]  Theodore R. Bashkow,et al.  A large scale, homogeneous, fully distributed parallel machine, I , 1977, ISCA '77.