Skip to main content
Log in

Choice coordination with limited failure

  • Published:
Distributed Computing Aims and scope Submit manuscript

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(t 2). A semi-synchronous model is also studied. A reduction to a consensus problem proves the necessity to assume some powerful atomic shared-memory operations.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ben-Or, M (1983) Another Advantage of Free Choice. Proc 2nd ACM Symp of Principles of Distributed Computing, 1983

  • Fischer, MJ, Lynch, NA, Paterson, MS (1985) Impossibility of Distributed Consensus with One Faulty Process. J ACM 32:374–382

    Google Scholar 

  • Herlihy, MP (1988) Impossibility and Universality Results for Wait-Free Synchronization. Proc 7th ACM Symp of Principles of Distributed Computing, 1988, pp 276–290

  • Rabin, MO (1982) The Choice Coordination Problem. Acta Inf 17:121–134

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bar-Noy, A., Ben-Or, M. & Dolev, D. Choice coordination with limited failure. Distrib Comput 3, 61–72 (1989). https://doi.org/10.1007/BF01558664

Download citation

  • Issue Date:

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

Key words

Navigation