Simple Constant-Time Consensus Protocols in Realistic Failure Models

Benny Chor; Michael Merritt; David B. Shmoys

doi:10.1145/65950.65956

Simple Constant-Time Consensus Protocols in Realistic Failure Models

Benny Chor, Michael Merritt, David B. Shmoys

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

45 Scopus citations

Abstract

Using simple protocols, it is shown how to achieve consensus in constant expected time, within a variety of fail-stop and omission failure models. Significantly, the strongest models considered are completely asynchronous. All of the results are based on distributively flipping a coin, which is usable by a significant majority of the processors. Finally, a nearly matching lower bound is also given for randomized protocols for consensus.

Original language	English
Pages (from-to)	591-614
Number of pages	24
Journal	Journal of the ACM
Volume	36
Issue number	3
DOIs	https://doi.org/10.1145/65950.65956
State	Published - 7 Jan 1989
Externally published	Yes

Access to Document

10.1145/65950.65956

Cite this

@article{9e8cace11e9f424595d6e4aa603b7f23,

title = "Simple Constant-Time Consensus Protocols in Realistic Failure Models",

abstract = "Using simple protocols, it is shown how to achieve consensus in constant expected time, within a variety of fail-stop and omission failure models. Significantly, the strongest models considered are completely asynchronous. All of the results are based on distributively flipping a coin, which is usable by a significant majority of the processors. Finally, a nearly matching lower bound is also given for randomized protocols for consensus.",

author = "Benny Chor and Michael Merritt and Shmoys, {David B.}",

year = "1989",

month = jan,

day = "7",

doi = "10.1145/65950.65956",

language = "אנגלית",

volume = "36",

pages = "591--614",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - Simple Constant-Time Consensus Protocols in Realistic Failure Models

AU - Chor, Benny

AU - Merritt, Michael

AU - Shmoys, David B.

PY - 1989/1/7

Y1 - 1989/1/7

N2 - Using simple protocols, it is shown how to achieve consensus in constant expected time, within a variety of fail-stop and omission failure models. Significantly, the strongest models considered are completely asynchronous. All of the results are based on distributively flipping a coin, which is usable by a significant majority of the processors. Finally, a nearly matching lower bound is also given for randomized protocols for consensus.

AB - Using simple protocols, it is shown how to achieve consensus in constant expected time, within a variety of fail-stop and omission failure models. Significantly, the strongest models considered are completely asynchronous. All of the results are based on distributively flipping a coin, which is usable by a significant majority of the processors. Finally, a nearly matching lower bound is also given for randomized protocols for consensus.

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

U2 - 10.1145/65950.65956

DO - 10.1145/65950.65956

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0024701074

SN - 0004-5411

VL - 36

SP - 591

EP - 614

JO - Journal of the ACM

JF - Journal of the ACM

IS - 3

ER -

Simple Constant-Time Consensus Protocols in Realistic Failure Models

Abstract

Access to Document

Other files and links

Fingerprint

Cite this