Skip to main content
SpringerLink
Log in

Fault-tolerant gossiping on hypercube multicomputers

  • Systems
  • Conference paper
  • First Online:
Distributed Memory Computing (EDMCC 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 487))

Included in the following conference series:

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.

This work is supported by the Research program C3 of the CNRS and MEN, and by the Direction des Recherches et Etudes Techniques (DGA).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  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. 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.

    Article  MathSciNet  Google Scholar 

  3. M. Cosnard and P. Fraigniaud. Finding the roots of a polynomial on an MIMD multicomputer. Parallel Computing, 15:75–85, 1990.

    Article  MathSciNet  Google Scholar 

  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. 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. 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. P. Fraigniaud. Performance analysis of broadcasting in hypercubes with restricted communication capabilities. Research report 90-16, LIP-IMAG, ENS Lyon, France, 1990.

    MATH  Google Scholar 

  8. A. Ghafoor and P. Sole. Performance of fault-tolerant diagnostics in the hypercube systems. IEEE Trans. on Comp., 38(8):1164–1172, 1989.

    Article  Google Scholar 

  9. S. Hedetniemi, S. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319–349, 1986.

    Article  MathSciNet  Google Scholar 

  10. S. Johnsson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Comp., 38(9):1249–1268, 1989.

    Article  MathSciNet  Google Scholar 

  11. E. Lazard. Broadcasting in DMA-bound bounded degree graphs. Research report (to appear in Disc. Appl. Math.), LRI, Orsay, France, 1990.

    MATH  Google Scholar 

  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. 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. P. Ramanathan and K. Shin. Reliable broadcast in hypercube multicomputers. IEEE Transactions on Computers, 37(12):1654–1657, 1988.

    Article  Google Scholar 

  15. Y. Saad and M. Schultz. Topological properties of hypercubes. IEEE Transaction on Computers, 37(7):867–871, 1988.

    Article  Google Scholar 

  16. Y. Saad and M. Schultz. Data communication in hypercubes. JJPD, 6:115–135, 1989.

    Google Scholar 

  17. Y. Saad and M. Schultz. Data communication in parallel architectures. Parallel Computing, 11:131–150, 1989.

    Article  MathSciNet  Google Scholar 

  18. S. Seidel. Circuit-switched vs. store and forward solutions to symmetric communication problems. HCCA 4, 1989.

    Google Scholar 

  19. Q. Stout and B. Wagar. Intensive hypercube communication, prearranged communication in link-bound machines. JPDC, 10:167–181, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de l'Informatique du Parallélisme - IMAG Ecole Normale Supérieure de Lyon, 46, Allée d'Italie, 69364, LYON CEDEX 07, France

    Pierre Fraigniaud

Authors
  1. Pierre Fraigniaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fraigniaud, P. (1991). Fault-tolerant gossiping on hypercube multicomputers. In: Bode, A. (eds) Distributed Memory Computing. EDMCC 1991. Lecture Notes in Computer Science, vol 487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032962

Download citation

  • DOI: https://doi.org/10.1007/BFb0032962

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53951-3

  • Online ISBN: 978-3-540-46478-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation