Skip to main content
SpringerLink
Log in

Choice coordination with multiple alternatives (preliminary version)

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1992)

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

Included in the following conference series:

Abstract

The Choice Coordination Problem with k alternatives (k-CCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processes which causes all correct processes to agree on one out of k possible alternatives. The agreement on a single choice is complicated by the fact that there is no a priori agreement on names for the alternatives. Furthermore processes must state their choice and do all communication via registers associated with the alternatives. We exactly characterize when the k-CCP can be solved deterministiclly, prove upper and lower space bounds for deterministic solutions, and provide a randomized protocol which is significantly better than the deterministic lower bound.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bar-Noy, M. Ben-Or, and D. Dolev. Choice coordination with limited failure. Distributed Computing, 3:61–72, 1989.

    Google Scholar 

  2. M. J. Fischer. The consensus problem in unreliable distributed systems (a brief survey). In M. Karpinsky, editor, Foundations of Computation Theory, pages 127–140. Lecture Notes in Computer Science, vol. 158, Springer-Verlag, 1983.

    Google Scholar 

  3. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382, April 1985.

    Google Scholar 

  4. R. M. Karp. Probabilistic Recurrence Relations. In Proc. 23rd ACM Symp. on Theory of Computing, pages 190–197, 1991.

    Google Scholar 

  5. C. M. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163–183, 1987.

    Google Scholar 

  6. M. O. Rabin. The choice coordination problem. Acta Informatica, 17:121–134, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sandia National Labs, P.O. Box 5800, 87185, Albuquerque, NM

    David S. Greenberg

  2. AT&T Bell Laboratories, 600 Mountain Avenue, 07974, Murray Hill, NJ

    Gadi Taubenfeld

  3. Yale University, 06520, New Haven, CT

    Da-Wei Wang

Authors
  1. David S. Greenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gadi Taubenfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Da-Wei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Adrian Segall Shmuel Zaks

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greenberg, D.S., Taubenfeld, G., Wang, DW. (1992). Choice coordination with multiple alternatives (preliminary version). In: Segall, A., Zaks, S. (eds) Distributed Algorithms. WDAG 1992. Lecture Notes in Computer Science, vol 647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56188-9_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-56188-9_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56188-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation