research-article

Distributed agreement with optimal communication complexity

Authors:

Dariusz R. KowalskiAuthors Info & Claims

SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms

Pages 965 - 977

Published: 17 January 2010 Publication History

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

References

[1]

S. Amdur, S. Weber, and V. Hadzilacos. On the message complexity of binary agreement under crash failures. Distributed Computing, 5(4):175--186, 1992.

Digital Library

[2]

J. Aspnes. Randomized protocols for asynchronous consensus. Distributed Computing, 16(2--3):165--175, 2003.

Digital Library

[3]

H. Attiya and K. Censor. Lower bounds for randomized consensus under a weak adversary. In Proceedings of the Twenty-Seventh Symposium on Principles of Distributed Computing (PODC), pages 315--324. ACM, 2008.

Digital Library

[4]

H. Attiya and K. Censor. Tight bounds for asynchronous randomized consensus. J. of the ACM, 55(5):1--26, 2008.

Digital Library

[5]

M. Ben-Or, E. Pavlov, and V. Vaikuntanathan. Byzantine agreement in the full-information model in o(log n) rounds. In Proceedings of the Thirty-Eighth Symposium on Theory of Computing (STOC), pages 179--186. ACM, 2006.

Digital Library

[6]

B. Chlebus and D. Kowalski. Gossiping to reach consensus. In Proceedings of 14th Symposium on Parallel Algorithms and Architectures (SPAA), pages 220--229, 2002.

Digital Library

[7]

B. Chlebus and D. Kowalski. Robust gossiping with an application to consensus. Journal of Computer and System Science, 72(8):1262--1281, 2006.

Digital Library

[8]

B. Chlebus and D. Kowalski. Locally scalable randomized consensus for synchronous crash failures. In Proceedings of 21st Symposium on Parallel Algorithms and Architectures (SPAA), 2009.

Digital Library

[9]

B. S. Chlebus and D. R. Kowalski. Randomization helps to perform independent tasks reliably. Random Struct. Algorithms, 24(1):11--41, 2004.

Digital Library

[10]

B. S. Chlebus, D. R. Kowalski, and M. Strojnowski. Fast scalable deterministic consensus for crash failures. In Proceedings of the 28th Symposium on Principles of Distributed Computing (PODC), 2009.

Digital Library

[11]

B. Chor, M. Merritt, and D. B. Shmoys. Simple constant-time consensus protocols in realistic failure models. J. of the ACM, 36(3):591--614, 1989.

Digital Library

[12]

D. Dolev and H. Strong. Requirements for agreement in a distributed system. Technical Report RJ 3418, IBM Research, San Jose, CA, Mar. 1982.

[13]

C. Dwork, J. Halpern, and O. Waarts. Performing work efficiently in the presence of faults. SIAM Journal on Computing, 27(5):1457--1491, 1998.

Digital Library

[14]

C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288--323, 1988.

Digital Library

[15]

Z. Galil, A. Mayer, and M. Yung. Resolving message complexity of byzantine agreement and beyond. In Proceedings of the 36th Symposium on Foundations of Computer Science (FOCS), pages 724--733, 1995.

Digital Library

[16]

C. Georgiou, S. Gilbert, R. Guerraoui, and D. Kowalski. On the complexity of asynchronous gossip. In Proceeding of the 27th Symposium on Principles of Distributed Computing (PODC), 2008.

Digital Library

[17]

S. Gilbert, R. Guerraoui, and D. Kowalski. On the message complexity of indulgent consensus. In Proceedings of the the 21st International Symposium on Distributed Computing (DISC), 2007.

Digital Library

[18]

B. M. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani. Fast asynchronous byzantine agreement and leader election with full information. In Proceedings of the Nineteenth Annual Symposium on Discrete Algorithms (SODA), pages 1038--1047, 2008.

Digital Library

[19]

R. M. Karp, C. Schindelhauer, S. Shenker, and B. Vcking. Randomized rumor spreading. In Proceedings of the 41st Symposium on Foundations of Computer Science (FOCS), 2000.

Digital Library

[20]

V. King and J. Saia. Fast, scalable byzantine agreement in the full information model with a nonadaptive adversary. In Proceedings of the 23rd International Symposium on Distributed Computing (DISC), 2009.

[21]

V. King, J. Saia, V. Sanwalani, and E. Vee. Scalable leader election. In Proceedings of the Seventeenth Annual Symposium on Discrete Algorithms (SODA), pages 990--999, 2006.

Digital Library

[22]

L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. ToPLaS, 4(3):382--401, 1982.

Digital Library

[23]

N. Lynch. Distributed Algorithms. Morgan Kaufman, 1996.

Digital Library

[24]

D. Malkhi, M. K. Reiter, A. Wool, and R. N. Wright. Probabilistic quorum systems. Information and Computation, 170(2):184--206, 2001.

Digital Library

[25]

M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228--234, 1980.

Digital Library

Cited By

Zhu YRiad KGuo RGan GFeng R(2019)New instant confirmation mechanism based on interactive incontestable signature in consortium blockchainFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-017-6338-813:6(1182-1197)Online publication date: 1-Dec-2019
https://dl.acm.org/doi/10.1007/s11704-017-6338-8
Gilbert SRobinson PSourav SNewport CKeidar I(2018)Leader Election in Well-Connected GraphsProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212754(227-236)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212754
Robinson PScheideler CSetzer AScheideler CFineman J(2018)Breaking the $ilde$Omega($sqrt{n})$ BarrierProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210399(173-182)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210399
Show More Cited By

Distributed agreement with optimal communication complexity

Recommendations

An optimal distributed (Δ+1)-coloring algorithm?
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing

Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for (Δ+1)-list coloring in the randomized LOCAL model running in O(log^∗n + Det_d(poly logn)) time, where Det_d(n′) ...
An optimal bit complexity randomized distributed MIS algorithm

We present a randomized distributed maximal independent set (MIS) algorithm for arbitrary graphs of size n that halts in time O(log n) with probability 1 ? o(n?1), and only needs messages containing 1 bit. Thus, its bit complexity par channel is O(log n)...
On the bit communication complexity of randomized rumor spreading
SPAA '10: Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures

We study the communication complexity of rumor spreading in the random phone-call model. Suppose nplayers communicate in parallel rounds, where in each round every player calls a randomly selected communication partner. A player u is allowed to exchange ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms

January 2010

1690 pages

ISBN:9780898716986

Program Chair:
Moses Charikar
Princeton University

Sponsors

SIAM Activity Group on Discrete Mathematics
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 17 January 2010

Check for updates

Qualifiers

Research-article

Acceptance Rates

SODA '10 Paper Acceptance Rate 135 of 445 submissions, 30%;

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
104
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhu YRiad KGuo RGan GFeng R(2019)New instant confirmation mechanism based on interactive incontestable signature in consortium blockchainFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-017-6338-813:6(1182-1197)Online publication date: 1-Dec-2019
https://dl.acm.org/doi/10.1007/s11704-017-6338-8
Gilbert SRobinson PSourav SNewport CKeidar I(2018)Leader Election in Well-Connected GraphsProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212754(227-236)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212754
Robinson PScheideler CSetzer AScheideler CFineman J(2018)Breaking the $ilde$Omega($sqrt{n})$ BarrierProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210399(173-182)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210399
Becchetti LClementi ANatale EPasquale FTrevisan L(2016)Stabilizing consensus with many opinionsProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884481(620-635)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884481
Luu LNarayanan VZheng CBaweja KGilbert SSaxena PWeippl EKatzenbeisser SKruegel CMyers AHalevi S(2016)A Secure Sharding Protocol For Open BlockchainsProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security10.1145/2976749.2978389(17-30)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2976749.2978389
Chen BYu HZhao YGibbons P(2014)The Cost of Fault Tolerance in Multi-Party Communication ComplexityJournal of the ACM10.1145/259763361:3(1-64)Online publication date: 2-Jun-2014
https://dl.acm.org/doi/10.1145/2597633
Doerr BGoldberg LMinder LSauerwald TScheideler CMeyer auf der Heide FRajaraman R(2011)Stabilizing consensus with the power of two choicesProceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures10.1145/1989493.1989516(149-158)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1989493.1989516
Fusco E(2011)Communication complexity of consensus in anonymous message passing systemsProceedings of the 15th international conference on Principles of Distributed Systems10.1007/978-3-642-25873-2_14(191-206)Online publication date: 13-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25873-2_14
Chlebus BKowalski DStrojnowski M(2010)Scalable quantum consensus for crash failuresProceedings of the 24th international conference on Distributed computing10.5555/1888781.1888814(236-250)Online publication date: 13-Sep-2010
https://dl.acm.org/doi/10.5555/1888781.1888814
Alistarh DGilbert SGuerraoui RZadimoghaddam M(2010)How efficient can gossip be? (on the cost of resilient information exchange)Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II10.5555/1880999.1881012(115-126)Online publication date: 6-Jul-2010
https://dl.acm.org/doi/10.5555/1880999.1881012

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents