article

Lower bounds for asynchronous consensus

Author:

Leslie LamportAuthors Info & Claims

Distributed Computing, Volume 19, Issue 2

Pages 104 - 125

https://doi.org/10.1007/s00446-006-0155-x

Published: 01 October 2006 Publication History

Abstract

Impossibility results and best-case lower bounds are proved for the number of message delays and the number of processes required to reach agreement in an asynchronous consensus algorithm that tolerates non-Byzantine failures. General algorithms exist that achieve these lower bounds in the normal case, when the response time of non-faulty processes and the transmission delay of messages they send to one another are bounded. Our theorems allow algorithms to do better in certain exceptional cases, and such algorithms are presented. Two of these exceptional algorithms may be of practical interest.

References

[1]

Brasileiro, F., Greve, F., Mostefaoui, A., Raynal, M.: Consensus in one communication step. In: Malyshkin, V. (ed.). Parallel Computing Technologies (6th International Conference, PaCT 2001), Lecture Notes in Computer Science, vol. 2127, pp. 42---50. Springer-Verlag (2001)

Digital Library

Google Scholar

[2]

Charron-Bost, B., Schiper, A.: Uniform consensus is harder than consensus (extended abstract). Technical Report DSC/2000/028, école Polytechnique Fédérale de Lausanne, Switzerland (2000). http://lsewww.epfl.ch/Publications/ById/263.html

Google Scholar

[3]

De Prisco, R., Lampson, B., Lynch, N.: Revisiting the paxos algorithm. Theor. Comput. Sci. 243:35---91 (2000)

Digital Library

Google Scholar

[4]

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

Digital Library

Google Scholar

[5]

Fischer, M.J., Lynch, N., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374---382 (1985)

Digital Library

Google Scholar

[6]

Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558---565 (1978)

Digital Library

Google Scholar

[7]

Lamport, L.: How to write a proof. American Mathematical Monthly 102(7):600---608 (1995)

Crossref

Google Scholar

[8]

Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133---169 (1998)

Digital Library

Google Scholar

[9]

Lamport, L.: Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32(4), 18---25 (2001)

Google Scholar

[10]

Lamport, L.: Lower bounds for asynchronous consensus. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds.). Future Directions in Distributed Computing, Lecture Notes in Computer Science, vol. 2584, pp. 22---23. Springer (2003)

Digital Library

Google Scholar

[11]

Lamport, L.: Specifying Systems. Addison-Wesley, Boston (2003)

Google Scholar

[12]

Lamport, L.: Fast paxos. Tech. Rep. MSR-TR-2005-112, Microsoft Research (2005)

Google Scholar

[13]

Pedone, F., Schiper, A.: Handling message semantics with generic broadcast. Distributed Computing 15(2), 97---107 (2002)

Digital Library

Google Scholar

[14]

Wensley, J., et al.: SIFT: Design and analysis of a fault-tolerant computer for aircraft control. Proceedings of the IEEE 66(10), 1240---1254 (1978)

Crossref

Google Scholar

Cited By

View all

Nasirifard PMayer RJacobsen H(2023)OrderlessChainProceedings of the 24th International Middleware Conference10.1145/3590140.3629111(137-150)Online publication date: 27-Nov-2023
https://dl.acm.org/doi/10.1145/3590140.3629111
Sliwinski JVonlanthen YWattenhofer R(2022)Consensus on DemandStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-21017-4_20(299-313)Online publication date: 15-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-21017-4_20
Cason DMilosevic NMilosevic ZPedone FZhang KGherbi AVenkatasubramanian NVeiga L(2021)Gossip consensusProceedings of the 22nd International Middleware Conference10.1145/3464298.3493395(198-209)Online publication date: 6-Dec-2021
https://dl.acm.org/doi/10.1145/3464298.3493395
Show More Cited By

Index Terms

Lower bounds for asynchronous consensus
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Index terms have been assigned to the content through auto-classification.

Recommendations

Asynchronous Consensus in Synchronous Systems Using send_to_all Primitive
Abstract
Consensus is a fundamental agreement problem that arises when a set of distributed processes has to decide on a common value among their respective proposals. An asynchronous consensus algorithm is capable of preserving the safety property of ... $\frac{}{}$
A tight lower bound for k-set agreement
SFCS '93: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

We prove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where processors fail by crashing. We prove a lower bound of [f/k]+1 rounds of ...
The bounds of faulty components on consensus with dual failure modes

The consensus is an important topic in the reliable distributed system because the system can cope with the influences from faulty components when the agreement is achieved. Siu, Chin and Yang have indicated that the bound on the number of allowable ...

Comments

Information & Contributors

Information

Published In

Distributed Computing Volume 19, Issue 2

October 2006

83 pages

ISSN:0178-2770

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 October 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nasirifard PMayer RJacobsen H(2023)OrderlessChainProceedings of the 24th International Middleware Conference10.1145/3590140.3629111(137-150)Online publication date: 27-Nov-2023
https://dl.acm.org/doi/10.1145/3590140.3629111
Sliwinski JVonlanthen YWattenhofer R(2022)Consensus on DemandStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-21017-4_20(299-313)Online publication date: 15-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-21017-4_20
Cason DMilosevic NMilosevic ZPedone FZhang KGherbi AVenkatasubramanian NVeiga L(2021)Gossip consensusProceedings of the 22nd International Middleware Conference10.1145/3464298.3493395(198-209)Online publication date: 6-Dec-2021
https://dl.acm.org/doi/10.1145/3464298.3493395
Rong YWu WChen Z(2019)COMBFTProceedings of the 48th International Conference on Parallel Processing10.1145/3337821.3337885(1-10)Online publication date: 5-Aug-2019
https://dl.acm.org/doi/10.1145/3337821.3337885
Bravo MGotsman ARobinson PEllen F(2019)Reconfigurable Atomic Transaction CommitProceedings of the 2019 ACM Symposium on Principles of Distributed Computing10.1145/3293611.3331590(399-408)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1145/3293611.3331590
Zhang ISharma NSzekeres AKrishnamurthy APorts D(2018)Building Consistent Transactions with Inconsistent ReplicationACM Transactions on Computer Systems10.1145/326998135:4(1-37)Online publication date: 16-Dec-2018
https://dl.acm.org/doi/10.1145/3269981
Wang YZhong QQiu XLi W(2018)Resource Allocation for Reliable Communication Between Controllers and Switches in SDNJournal of Network and Systems Management10.1007/s10922-018-9450-726:4(966-992)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s10922-018-9450-7
Guerraoui RWang JSallinger EVan den Bussche JGeerts F(2017)How Fast can a Distributed Transaction Commit?Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3034786.3034799(107-122)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3034786.3034799
Schiff LSchmid SKuznetsov P(2016)In-Band Synchronization for Distributed SDN Control PlanesACM SIGCOMM Computer Communication Review10.1145/2875951.287595746:1(37-43)Online publication date: 11-Jan-2016
https://dl.acm.org/doi/10.1145/2875951.2875957
Ports DLi JLiu VSharma NKrishnamurthy ABarham PKrishnamurthy A(2015)Designing distributed systems using approximate synchrony in data center networksProceedings of the 12th USENIX Conference on Networked Systems Design and Implementation10.5555/2789770.2789774(43-57)Online publication date: 4-May-2015
https://dl.acm.org/doi/10.5555/2789770.2789774
Show More Cited By

View Options

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.

Cited By

Index Terms

Recommendations

Asynchronous Consensus in Synchronous Systems Using send_to_all Primitive

A tight lower bound for k-set agreement

The bounds of faulty components on consensus with dual failure modes

Comments

Published In

Publisher

Publication History

Author Tags

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Asynchronous Consensus in Synchronous Systems Using send_to_all Primitive

A tight lower bound for k-set agreement

The bounds of faulty components on consensus with dual failure modes

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations