Choice coordination with multiple alternatives

David S. Greenberg, Gadi Taubenfeld, Da Wei Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationDistributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings
EditorsAdrian Segall, Shmuel Zaks
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540561880
StatePublished - 1992
Externally publishedYes
Event6th International Workshop on Distributed Algorithms, WDAG 1992 - Haifa, Israel
Duration: 2 Nov 19924 Nov 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume647 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International Workshop on Distributed Algorithms, WDAG 1992

Bibliographical note

Publisher Copyright:
© 1992, Springer Verlag. All rights reserved.


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

Cite this