Advertisement

Choice coordination with multiple alternatives (preliminary version)

  • David S. Greenberg
  • Gadi Taubenfeld
  • Da-Wei Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 647)

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.

Keywords

Unique Identifier Correct Process Consensus Problem Deterministic Solution Faulty Process 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BBD89]
    A. Bar-Noy, M. Ben-Or, and D. Dolev. Choice coordination with limited failure. Distributed Computing, 3:61–72, 1989.Google Scholar
  2. [Fis83]
    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. [FLP85]
    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. [K91]
    R. M. Karp. Probabilistic Recurrence Relations. In Proc. 23rd ACM Symp. on Theory of Computing, pages 190–197, 1991.Google Scholar
  5. [LA87]
    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. [Rab82]
    M. O. Rabin. The choice coordination problem. Acta Informatica, 17:121–134, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • David S. Greenberg
    • 1
  • Gadi Taubenfeld
    • 2
  • Da-Wei Wang
    • 3
  1. 1.Sandia National LabsAlbuquerque
  2. 2.AT&T Bell LaboratoriesMurray Hill
  3. 3.Yale UniversityNew Haven

Personalised recommendations