On the message complexity of indulgent consensus

Seth Gilbert; Rachid Guerraoui; Dariusz R. Kowalski

doi:10.1007/978-3-540-75142-7_23

On the message complexity of indulgent consensus

Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

Abstract

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(n^1+ε). 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 Ω(n²) in well-behaved executions.

Original language	English (US)
Title of host publication	Distributed Computing - 21st International Symposium, DISC 2007, Proceedings
Publisher	Springer Verlag
Pages	283-297
Number of pages	15
ISBN (Print)	9783540751410
DOIs	https://doi.org/10.1007/978-3-540-75142-7_23
State	Published - 2007
Externally published	Yes
Event	21st International Symposium on Distributed Computing, DISC 2007 - Lemesos, Cyprus Duration: Sep 24 2007 → Sep 26 2007

Publication series

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

Conference

Conference	21st International Symposium on Distributed Computing, DISC 2007
Country/Territory	Cyprus
City	Lemesos
Period	9/24/07 → 9/26/07

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-75142-7_23

Cite this

Gilbert, S., Guerraoui, R., & Kowalski, D. R. (2007). On the message complexity of indulgent consensus. In Distributed Computing - 21st International Symposium, DISC 2007, Proceedings (pp. 283-297). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4731 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-75142-7_23

On the message complexity of indulgent consensus. / Gilbert, Seth; Guerraoui, Rachid; Kowalski, Dariusz R.
Distributed Computing - 21st International Symposium, DISC 2007, Proceedings. Springer Verlag, 2007. p. 283-297 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4731 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Gilbert, S, Guerraoui, R & Kowalski, DR 2007, On the message complexity of indulgent consensus. in Distributed Computing - 21st International Symposium, DISC 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4731 LNCS, Springer Verlag, pp. 283-297, 21st International Symposium on Distributed Computing, DISC 2007, Lemesos, Cyprus, 9/24/07. https://doi.org/10.1007/978-3-540-75142-7_23

Gilbert S, Guerraoui R, Kowalski DR. On the message complexity of indulgent consensus. In Distributed Computing - 21st International Symposium, DISC 2007, Proceedings. Springer Verlag. 2007. p. 283-297. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-75142-7_23

@inproceedings{8b7cdb97f765473db64e3854f5a7a8f8,

title = "On the message complexity of indulgent consensus",

abstract = "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.",

author = "Seth Gilbert and Rachid Guerraoui and Kowalski, {Dariusz R.}",

year = "2007",

doi = "10.1007/978-3-540-75142-7_23",

language = "English (US)",

isbn = "9783540751410",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "283--297",

booktitle = "Distributed Computing - 21st International Symposium, DISC 2007, Proceedings",

note = "21st International Symposium on Distributed Computing, DISC 2007 ; Conference date: 24-09-2007 Through 26-09-2007",

}

TY - GEN

T1 - On the message complexity of indulgent consensus

AU - Gilbert, Seth

AU - Guerraoui, Rachid

AU - Kowalski, Dariusz R.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/978-3-540-75142-7_23

DO - 10.1007/978-3-540-75142-7_23

M3 - Conference contribution

AN - SCOPUS:38049011966

SN - 9783540751410

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 283

EP - 297

BT - Distributed Computing - 21st International Symposium, DISC 2007, Proceedings

PB - Springer Verlag

T2 - 21st International Symposium on Distributed Computing, DISC 2007

Y2 - 24 September 2007 through 26 September 2007

ER -

On the message complexity of indulgent consensus

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this