Distributed Computing

, Volume 3, Issue 2, pp 61–72 | Cite as

Choice coordination with limited failure

  • Amotz Bar-Noy
  • Michael Ben-Or
  • Danny Dolev
Article

Abstract

The Choice Coordination Problem requiresn asynchronous processes to reach a common choice of one out ofk possible alternatives. Processes communicate viak shared variables. Up tot, t<n, of the processes may fail to operate by suddenly quitting the protocol. Rabin (1982) presented lower and upper bounds for the extreme caset=n−1. We present deterministic and randomized algorithms for arbitraryt using an alphabet of sizeO(t2). A semi-synchronous model is also studied. A reduction to a consensus problem proves the necessity to assume some powerful atomic shared-memory operations.

Key words

Choice coordination Probabilistic versus deterministic algorithms Resilient algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben-Or, M (1983) Another Advantage of Free Choice. Proc 2nd ACM Symp of Principles of Distributed Computing, 1983Google Scholar
  2. Fischer, MJ, Lynch, NA, Paterson, MS (1985) Impossibility of Distributed Consensus with One Faulty Process. J ACM 32:374–382Google Scholar
  3. Herlihy, MP (1988) Impossibility and Universality Results for Wait-Free Synchronization. Proc 7th ACM Symp of Principles of Distributed Computing, 1988, pp 276–290Google Scholar
  4. Rabin, MO (1982) The Choice Coordination Problem. Acta Inf 17:121–134Google Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Amotz Bar-Noy
    • 1
  • Michael Ben-Or
    • 2
  • Danny Dolev
    • 2
    • 3
  1. 1.Department of Computer ScienceStanford UniversityStanfordUSA
  2. 2.Department of Computer ScienceThe Hebrew UniversityJerusalemIsrael
  3. 3.K 53 Almaden Research CenterIBM ResearchSan JoséUSA

Personalised recommendations