Advertisement

Fault-tolerant gossiping on hypercube multicomputers

  • Pierre Fraigniaud
Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 487)

Abstract

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.

Keywords

Gossiping Total Exchange fault tolerance hypercube time complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    M. Alam and R. Melhem. How to use an incomplete binary hypercube for fault tolerance. In F. Andre and J. Verjus, editors, Hypercube and Distributed Computers, pages 329–341. North-Holland, 1989.Google Scholar
  2. [2]
    M. Chen and K. Shin. Depth-first search approach for fault-tolerant routing in hypercube multicomputers. IEEE Trans on Parallel and Distributed Systems, 1(2):152–159, 1990.Google Scholar
  3. [3]
    M. Cosnard and P. Fraigniaud. Finding the roots of a polynomial on an MIMD multicomputer. Parallel Computing, 15:75–85, 1990.Google Scholar
  4. [4]
    A.-H. Esfahanian. Generalized measures of fault tolerance with application to n-cube networks. IEEE TC, 58(11):1586–1591, 1989.Google Scholar
  5. [5]
    P. Fraigniaud. Asymptotically optimal broadcasting and total exchange algorithms in faulty hypercube multicomputers. Research report 89-05, LIP-IMAG, ENS Lyon, France, 1989.Google Scholar
  6. [6]
    P. Fraigniaud. Performance analysis of broadcasting in hypercubes. In F. Andre and J. verjus, editors, Hypercubes and Distributed Computers, pages 311–328. North-Holland, 1989.Google Scholar
  7. [7]
    P. Fraigniaud. Performance analysis of broadcasting in hypercubes with restricted communication capabilities. Research report 90-16, LIP-IMAG, ENS Lyon, France, 1990.Google Scholar
  8. [8]
    A. Ghafoor and P. Sole. Performance of fault-tolerant diagnostics in the hypercube systems. IEEE Trans. on Comp., 38(8):1164–1172, 1989.Google Scholar
  9. [9]
    S. Hedetniemi, S. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319–349, 1986.Google Scholar
  10. [10]
    S. Johnsson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Comp., 38(9):1249–1268, 1989.Google Scholar
  11. [11]
    E. Lazard. Broadcasting in DMA-bound bounded degree graphs. Research report (to appear in Disc. Appl. Math.), LRI, Orsay, France, 1990.Google Scholar
  12. [12]
    C. Li and W. Fuchs. Graceful degradation on hypercube multiprocessors using data redistribution. Proceedings of DMCC5, Charleston, SC, April 8–12, 1990.Google Scholar
  13. [13]
    R. McLeod and J. Schellenberg. Percolation and anomalous transport as tools in analyzing parallel processing interconnection networks. JPDC, 8:376–387, 1990.Google Scholar
  14. [14]
    P. Ramanathan and K. Shin. Reliable broadcast in hypercube multicomputers. IEEE Transactions on Computers, 37(12):1654–1657, 1988.Google Scholar
  15. [15]
    Y. Saad and M. Schultz. Topological properties of hypercubes. IEEE Transaction on Computers, 37(7):867–871, 1988.Google Scholar
  16. [16]
    Y. Saad and M. Schultz. Data communication in hypercubes. JJPD, 6:115–135, 1989.Google Scholar
  17. [17]
    Y. Saad and M. Schultz. Data communication in parallel architectures. Parallel Computing, 11:131–150, 1989.Google Scholar
  18. [18]
    S. Seidel. Circuit-switched vs. store and forward solutions to symmetric communication problems. HCCA 4, 1989.Google Scholar
  19. [19]
    Q. Stout and B. Wagar. Intensive hypercube communication, prearranged communication in link-bound machines. JPDC, 10:167–181, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Pierre Fraigniaud
    • 1
  1. 1.Laboratoire de l'Informatique du Parallélisme - IMAG Ecole Normale Supérieure de LyonLYON CEDEX 07France

Personalised recommendations