Unbeatable consensus

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

doi:https://doi.org/10.1007/s00446-021-00417-3

Unbeatable consensus

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

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

The unbeatability of a consensus protocol, introduced by Halpern et al. (SIAM J Comput 31:838–865, 2001), is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledge-based analysis, this paper derives the first explicit unbeatable consensus protocols in the literature, for the standard synchronous message-passing model with crash failures. These protocols strictly dominate the best kno-wn protocols for uniform and for Nonuniform Consensus, in some cases improving on 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. All protocols presented in this paper have very concise descriptions, and are shown to be efficiently implementable.

Original language	English
Pages (from-to)	123-143
Number of pages	21
Journal	Distributed Computing
Volume	35
Issue number	2
DOIs	https://doi.org/10.1007/s00446-021-00417-3
State	Published - Apr 2022

Keywords

Consensus
Knowledge
Optimality
Uniform consensus

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Computational Theory and Mathematics

Access to Document

https://doi.org/10.1007/s00446-021-00417-3

Cite this

@article{01ff47821a8c44f48e9a79df1091683d,

title = "Unbeatable consensus",

abstract = "The unbeatability of a consensus protocol, introduced by Halpern et al. (SIAM J Comput 31:838–865, 2001), is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledge-based analysis, this paper derives the first explicit unbeatable consensus protocols in the literature, for the standard synchronous message-passing model with crash failures. These protocols strictly dominate the best kno-wn protocols for uniform and for Nonuniform Consensus, in some cases improving on 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. All protocols presented in this paper 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} 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.",

year = "2022",

month = apr,

doi = "https://doi.org/10.1007/s00446-021-00417-3",

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

volume = "35",

pages = "123--143",

journal = "Distributed Computing",

issn = "0178-2770",

publisher = "Springer Verlag",

number = "2",

}

TY - JOUR

T1 - Unbeatable consensus

AU - Castañeda, Armando

AU - Gonczarowski, Yannai A.

AU - Moses, Yoram

PY - 2022/4

Y1 - 2022/4

N2 - The unbeatability of a consensus protocol, introduced by Halpern et al. (SIAM J Comput 31:838–865, 2001), is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledge-based analysis, this paper derives the first explicit unbeatable consensus protocols in the literature, for the standard synchronous message-passing model with crash failures. These protocols strictly dominate the best kno-wn protocols for uniform and for Nonuniform Consensus, in some cases improving on 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. All protocols presented in this paper have very concise descriptions, and are shown to be efficiently implementable.

AB - The unbeatability of a consensus protocol, introduced by Halpern et al. (SIAM J Comput 31:838–865, 2001), is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledge-based analysis, this paper derives the first explicit unbeatable consensus protocols in the literature, for the standard synchronous message-passing model with crash failures. These protocols strictly dominate the best kno-wn protocols for uniform and for Nonuniform Consensus, in some cases improving on 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. All protocols presented in this paper 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=85122799187&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/s00446-021-00417-3

DO - https://doi.org/10.1007/s00446-021-00417-3

M3 - مقالة

SN - 0178-2770

VL - 35

SP - 123

EP - 143

JO - Distributed Computing

JF - Distributed Computing

IS - 2

ER -

Unbeatable consensus

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this