Unbeatable consensus

Armando Castañeda; Yannai A. Gonczarowski; Yoram Moses

doi:https://doi.org/10.1007/978-3-662-45174-8_7

Unbeatable consensus

Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses

Technion - Israel Institute of Technology

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

Abstract

The unbeatability of a consensus protocol, introduced by Halpern, Moses andWaarts in [15], is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledgebased analysis, this paper derives the first practical unbeatable consensus protocols in the literature, for the standard synchronous message-passing modelwith crash failures.These protocols strictly dominate the best known protocols for uniform and for non-uniform consensus, in some case beating them by a large margin. The analysis provides a new understanding of the logical structure of consensus, and of the distinction between uniform and nonuniform consensus. Finally, the first (early stopping and) unbeatable protocol that treats decision values “fairly” is presented. All of these protocols have very concise descriptions, and are shown to be efficiently implementable.

Original language	English
Title of host publication	Distributed Computing - 28th International Symposium, DISC 2014, Proceedings
Editors	Fabian Kuhn
Pages	91-106
Number of pages	16
ISBN (Electronic)	9783662451731
DOIs	https://doi.org/10.1007/978-3-662-45174-8_7
State	Published - 2014
Event	28th International Symposium on Distributed Computing, DISC 2014 - Austin, United States Duration: 12 Oct 2014 → 15 Oct 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8784

Conference

Conference	28th International Symposium on Distributed Computing, DISC 2014
Country/Territory	United States
City	Austin
Period	12/10/14 → 15/10/14

Keywords

Consensus
Knowledge
Optimality
Uniform consensus

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-662-45174-8_7

Cite this

Castañeda, A., Gonczarowski, Y. A., & Moses, Y. (2014). Unbeatable consensus. In F. Kuhn (Ed.), Distributed Computing - 28th International Symposium, DISC 2014, Proceedings (pp. 91-106). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8784). https://doi.org/10.1007/978-3-662-45174-8_7

@inproceedings{00a685602b4e4a80a94bf61ad6725d48,

title = "Unbeatable consensus",

abstract = "The unbeatability of a consensus protocol, introduced by Halpern, Moses andWaarts in [15], is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledgebased analysis, this paper derives the first practical unbeatable consensus protocols in the literature, for the standard synchronous message-passing modelwith crash failures.These protocols strictly dominate the best known protocols for uniform and for non-uniform consensus, in some case beating them by a large margin. The analysis provides a new understanding of the logical structure of consensus, and of the distinction between uniform and nonuniform consensus. Finally, the first (early stopping and) unbeatable protocol that treats decision values “fairly” is presented. All of these protocols have very concise descriptions, and are shown to be efficiently implementable.",

keywords = "Consensus, Knowledge, Optimality, Uniform consensus",

author = "Armando Casta{\~n}eda and Gonczarowski, {Yannai A.} and Yoram Moses",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2014.; 28th International Symposium on Distributed Computing, DISC 2014 ; Conference date: 12-10-2014 Through 15-10-2014",

year = "2014",

doi = "https://doi.org/10.1007/978-3-662-45174-8_7",

language = "الإنجليزيّة",

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

pages = "91--106",

editor = "Fabian Kuhn",

booktitle = "Distributed Computing - 28th International Symposium, DISC 2014, Proceedings",

}

Castañeda, A, Gonczarowski, YA & Moses, Y 2014, Unbeatable consensus. in F Kuhn (ed.), Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8784, pp. 91-106, 28th International Symposium on Distributed Computing, DISC 2014, Austin, United States, 12/10/14. https://doi.org/10.1007/978-3-662-45174-8_7

Unbeatable consensus. / Castañeda, Armando; Gonczarowski, Yannai A.; Moses, Yoram.
Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. ed. / Fabian Kuhn. 2014. p. 91-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8784).

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

TY - GEN

T1 - Unbeatable consensus

AU - Castañeda, Armando

AU - Gonczarowski, Yannai A.

AU - Moses, Yoram

PY - 2014

Y1 - 2014

N2 - The unbeatability of a consensus protocol, introduced by Halpern, Moses andWaarts in [15], is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledgebased analysis, this paper derives the first practical unbeatable consensus protocols in the literature, for the standard synchronous message-passing modelwith crash failures.These protocols strictly dominate the best known protocols for uniform and for non-uniform consensus, in some case beating them by a large margin. The analysis provides a new understanding of the logical structure of consensus, and of the distinction between uniform and nonuniform consensus. Finally, the first (early stopping and) unbeatable protocol that treats decision values “fairly” is presented. All of these protocols have very concise descriptions, and are shown to be efficiently implementable.

AB - The unbeatability of a consensus protocol, introduced by Halpern, Moses andWaarts in [15], is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledgebased analysis, this paper derives the first practical unbeatable consensus protocols in the literature, for the standard synchronous message-passing modelwith crash failures.These protocols strictly dominate the best known protocols for uniform and for non-uniform consensus, in some case beating them by a large margin. The analysis provides a new understanding of the logical structure of consensus, and of the distinction between uniform and nonuniform consensus. Finally, the first (early stopping and) unbeatable protocol that treats decision values “fairly” is presented. All of these protocols have very concise descriptions, and are shown to be efficiently implementable.

KW - Consensus

KW - Knowledge

KW - Optimality

KW - Uniform consensus

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

U2 - https://doi.org/10.1007/978-3-662-45174-8_7

DO - https://doi.org/10.1007/978-3-662-45174-8_7

M3 - منشور من مؤتمر

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

SP - 91

EP - 106

BT - Distributed Computing - 28th International Symposium, DISC 2014, Proceedings

A2 - Kuhn, Fabian

T2 - 28th International Symposium on Distributed Computing, DISC 2014

Y2 - 12 October 2014 through 15 October 2014

ER -

Unbeatable consensus

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this