Simple constant-time consensus protocols in realistic failure models (extended abstract)

Benny Chor, Michael Merritt, David B. Shmoys

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Using simple and elegant protocols, we show how to achieve consensus in constant expected time, within realistic failure models. Significantly, the strongest models considered are completely asynchronous. A nearly matching lower bound is also given.

Original languageEnglish
Title of host publicationProceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985
EditorsRay Strong, Michael Malcolm
PublisherAssociation for Computing Machinery
Pages152-162
Number of pages11
ISBN (Electronic)0897911687
DOIs
StatePublished - 1 Aug 1985
Externally publishedYes
Event4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985 - Minaki, Canada
Duration: 5 Aug 19857 Aug 1985

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985
Country/TerritoryCanada
CityMinaki
Period5/08/857/08/85

Funding

FundersFunder number
National Science FoundationDCR-8302385, DCR-8302391
Office of Naval ResearchN00014-85-K-0168
Defense Advanced Research Projects AgencyN00014-83-K-0125
International Business Machines Corporation
Office for the Advancement of Research, John Jay College of Criminal JusticeDAAG29-84-K-0058

    Cite this