Fault-Tolerant Gossiping on Hypercube Multicomputers

Various algorithms for reliable gossiping in faulty n dimensional hypercube multicomputers are described and analyzed. The goal is that each processor receives complete information from all the other processors even in the presence of faults. One of the main characteristic of the algorithms is that no information on the identity of the faulty nodes/links is required. The exchange between any two processors is realized such that the data moves through disjoint paths. We propose solutions designed for systems which use store and forward models of communication. The proposed algorithms are parametrized by the maximum number of faults that they can take into account. In all cases, they approach the minimum time complexity.

[1]  Parameswaran Ramanathan,et al.  Reliable Broadcast in Hypercube Multicomputers , 1988, IEEE Trans. Computers.

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

[3]  Chung-Chi Jim Li,et al.  Graceful Degradation on Hypercube Multiprocessors Using Data Redistribution , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

[4]  R.D. McLeod,et al.  Percolation and Anomalous Transport as Tools in Analyzing Parallel Processing Interconnection Networks , 1990, J. Parallel Distributed Comput..

[5]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[6]  Arif Ghafoor,et al.  Performance of Fault-Tolerant Diagnostics in the Hypercube Systems , 1989, IEEE Trans. Computers.

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

[8]  Yousef Saad,et al.  Data communication in parallel architectures , 1989, Parallel Comput..

[9]  Emmanuel Lazard,et al.  Broadcasting in DMA-Bound Bounded Degree Graphs , 1992, Discret. Appl. Math..

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

[11]  Abdol-Hossein Esfahanian,et al.  Generalized Measures of Fault Tolerance with Application to N-Cube Networks , 1989, IEEE Trans. Computers.

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

[13]  Pierre Fraigniaud,et al.  Finding the roots of a polynomial on an MIMD multicomputer , 1990, Parallel Comput..