Choice coordination with limited failure

Amotz Bar-Noy, Michael Ben-Or, Danny Dolev*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


The Choice Coordination Problem requires n asynchronous processes to reach a common choice of one out of k possible alternatives. Processes communicate via k shared variables. Up to t, t<n, of the processes may fail to operate by suddenly quitting the protocol. Rabin (1982) presented lower and upper bounds for the extreme case t=n-1. We present deterministic and randomized algorithms for arbitrary t using an alphabet of size O(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.

Original languageAmerican English
Pages (from-to)61-72
Number of pages12
JournalDistributed Computing
Issue number2
StatePublished - Jun 1989


  • Choice coordination
  • Probabilistic versus deterministic algorithms
  • Resilient algorithms


Dive into the research topics of 'Choice coordination with limited failure'. Together they form a unique fingerprint.

Cite this