Robust asynchronous algorithms in networks with a fault detection ring

Extended abstract
  • M. Molcho
  • S. Zaks
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 834)


In this paper we study asynchronous networks, in which processors may fail and recover several times during an execution. Upon recovery a processor rejoins the execution as a passive processor, with all variables initialized, except for a fault flag, which is updated by the system. In addition to the regular communication links connecting pairs of processors, the processors are connected by a unidirectional ring of communication links, such that upon a failure of a processor all of the processor's incoming messages are transferred to the outgoing link belonging to this ring. We present a general transformation, that modifies any algorithm, that is designed for an ordinary fault-free asynchronous network, to run on such networks.


Internal State Transformation Rule Communication Link Global State State Relay 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CC]
    M.Y. Chan and F.Y.L. Chin, Optimal resilient distributed algorithms for ring election, IEEE Transactions on Parallel and Distributed Systems, Vol. 4,No. 4, April 1993, 475–480.CrossRefGoogle Scholar
  2. [cr]1994
    Springer-VerlagE. Chang and R. Roberts, An improved algorithm for decentralized extrema-finding in circular configuration of processes, CACM 22,5, 1979, 281–283.Google Scholar
  3. [FF]
    R.E. Filman and D.P. Friedman, Coordinated computing: tools and techniques for distributed software, McGraw-Hill 1984.Google Scholar
  4. [FL]
    G. N. Frederickson and N. A. Lynch, Electing a leader in a synchronous ring, Journal of the ACM, No. 1, Vol. 34, 1987, 98–115.Google Scholar
  5. [GHS]
    R. G. Gallager, P. A. Humblet and P. M. Spira, A distributed algorithm for minimum spanning tree, Transactions on Programming Languages and Systems, 5, 1, 1983, 66–77.CrossRefGoogle Scholar
  6. [GS]
    O. Goldreich and L. Shrira, The effects of link failure on computations in asynchronous rings, Proc. of the ACM Symposium on Principles of Distributed Computing, Calgary, Alberta, Canada, August 1986, 174–185.Google Scholar
  7. [IKWZ]
    A. Itai, S. Kutten, Y. Wolfstahl and S. Zaks, Optimal distributed t-resilient election in complete networks, IEEE Transactions on Software Engineering, Vol. 16, No. 4, April 1990, 415–420.CrossRefGoogle Scholar
  8. [KMZ]
    E. Korach, S. Moran and S. Zaks, The Optimality of Distributed Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors, SIAM Journal on Computing, 16:2, 1987, 231–236.CrossRefGoogle Scholar
  9. [L]
    G. LeLann, Distributed systems — towards a formal approach, Information Processing 77, Elsevier Science, New York 1977, 155–160.Google Scholar
  10. [MZ]
    M. Molcho and S. Zaks, Distributed algorithms for asynchronous networks with a fault detection ring, M.Sc. Thesis, Department of computer science, Technion, Haifa, Israel, February 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • M. Molcho
    • 2
  • S. Zaks
    • 1
  1. 1.IBM Science & Technology MatamHaifaIsrael
  2. 2.Department of Computer Science TechnionHaifaIsrael

Personalised recommendations