Choice coordination with multiple alternatives

David S. Greenberg; Gadi Taubenfeld; Da Wei Wang

doi:10.1007/3-540-56188-9_4

Choice coordination with multiple alternatives

David S. Greenberg, Gadi Taubenfeld, Da Wei Wang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Distributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings
Editors	Adrian Segall, Shmuel Zaks
Publisher	Springer Verlag
Pages	54-68
Number of pages	15
ISBN (Print)	9783540561880
DOIs	https://doi.org/10.1007/3-540-56188-9_4
State	Published - 1992
Externally published	Yes
Event	6th International Workshop on Distributed Algorithms, WDAG 1992 - Haifa, Israel Duration: 2 Nov 1992 → 4 Nov 1992

Publication series

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

Conference

Conference	6th International Workshop on Distributed Algorithms, WDAG 1992
Country/Territory	Israel
City	Haifa
Period	2/11/92 → 4/11/92

Bibliographical note

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

Access to Document

10.1007/3-540-56188-9_4

Cite this

Greenberg, D. S., Taubenfeld, G., & Wang, D. W. (1992). Choice coordination with multiple alternatives. In A. Segall, & S. Zaks (Eds.), Distributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings (pp. 54-68). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 647 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-56188-9_4

Greenberg, David S. ; Taubenfeld, Gadi ; Wang, Da Wei. / Choice coordination with multiple alternatives. Distributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings. editor / Adrian Segall ; Shmuel Zaks. Springer Verlag, 1992. pp. 54-68 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9dc09f49fcca4ac987912d4172446fd5,

title = "Choice coordination with multiple alternatives",

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.",

author = "Greenberg, {David S.} and Gadi Taubenfeld and Wang, {Da Wei}",

note = "Publisher Copyright: {\textcopyright} 1992, Springer Verlag. All rights reserved.; 6th International Workshop on Distributed Algorithms, WDAG 1992 ; Conference date: 02-11-1992 Through 04-11-1992",

year = "1992",

doi = "10.1007/3-540-56188-9_4",

language = "אנגלית",

isbn = "9783540561880",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "54--68",

editor = "Adrian Segall and Shmuel Zaks",

booktitle = "Distributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings",

address = "גרמניה",

}

Greenberg, DS, Taubenfeld, G & Wang, DW 1992, Choice coordination with multiple alternatives. in A Segall & S Zaks (eds), Distributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 647 LNCS, Springer Verlag, pp. 54-68, 6th International Workshop on Distributed Algorithms, WDAG 1992, Haifa, Israel, 2/11/92. https://doi.org/10.1007/3-540-56188-9_4

Choice coordination with multiple alternatives. / Greenberg, David S.; Taubenfeld, Gadi; Wang, Da Wei.
Distributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings. ed. / Adrian Segall; Shmuel Zaks. Springer Verlag, 1992. p. 54-68 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 647 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Choice coordination with multiple alternatives

AU - Greenberg, David S.

AU - Taubenfeld, Gadi

AU - Wang, Da Wei

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0141776343&partnerID=8YFLogxK

U2 - 10.1007/3-540-56188-9_4

DO - 10.1007/3-540-56188-9_4

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0141776343

SN - 9783540561880

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 54

EP - 68

BT - Distributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings

A2 - Segall, Adrian

A2 - Zaks, Shmuel

PB - Springer Verlag

T2 - 6th International Workshop on Distributed Algorithms, WDAG 1992

Y2 - 2 November 1992 through 4 November 1992

ER -

Greenberg DS, Taubenfeld G, Wang DW. Choice coordination with multiple alternatives. In Segall A, Zaks S, editors, Distributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings. Springer Verlag. 1992. p. 54-68. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-56188-9_4

Choice coordination with multiple alternatives

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this