Distributed agreement with optimal communication complexity

Seth Gilbert, Dariusz R. Kowalski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Scopus citations

Abstract

We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication efficiency, using only O(n) bits of communication, and terminates in (almost optimal) time O(log n), with high probability. The same protocol, with minor modifications, can also be used in partially synchronous networks, guaranteeing correct behavior even in asynchronous executions, while maintaining efficient performance in synchronous executions. Finally, the same techniques also yield a randomized, fault-tolerant gossip protocol that terminates in O(log* n) rounds using O(n) messages (with bit complexity that depends on the data being gossiped).

Original languageEnglish (US)
Title of host publicationProceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms
Pages965-977
Number of pages13
StatePublished - May 6 2010
Externally publishedYes
Event21st Annual ACM-SIAM Symposium on Discrete Algorithms - Austin, TX, United States
Duration: Jan 17 2010Jan 19 2010

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference21st Annual ACM-SIAM Symposium on Discrete Algorithms
CountryUnited States
CityAustin, TX
Period1/17/101/19/10

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Distributed agreement with optimal communication complexity'. Together they form a unique fingerprint.

Cite this