Simple Constant-Time Consensus Protocols in Realistic Failure Models

Benny Chor, Michael Merritt, David B. Shmoys

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)591-614
Number of pages24
JournalJournal of the ACM
Volume36
Issue number3
DOIs
StatePublished - 7 Jan 1989
Externally publishedYes

Cite this