On the message complexity of indulgent consensus

Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski

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

5 Scopus citations


Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily long periods of asynchrony, and yet perform (asymptotically) optimally in well-behaved, synchronous executions with few failures. We present two such algorithms: In synchronous executions, the first has optimal message complexity, using only O(n) messages, but runs in superlinear time of O(n1+ε). The second has a message complexity of O(n polylog(n)), but has an optimal running time, completing in O(f) rounds in synchronous executions with at most f failures. Both of these results improve significantly over the most message-efficient of previous indulgent consensus algorithms which have a message complexity of at least Ω(n2) in well-behaved executions.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 21st International Symposium, DISC 2007, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540751410
StatePublished - 2007
Externally publishedYes
Event21st International Symposium on Distributed Computing, DISC 2007 - Lemesos, Cyprus
Duration: Sep 24 2007Sep 26 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4731 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference21st International Symposium on Distributed Computing, DISC 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'On the message complexity of indulgent consensus'. Together they form a unique fingerprint.

Cite this