article

Free access

On the minimal synchronism needed for distributed consensus

Authors:

Danny Dolev,

Cynthia Dwork,

Larry StockmeyerAuthors Info & Claims

Journal of the ACM (JACM), Volume 34, Issue 1

Pages 77 - 97

https://doi.org/10.1145/7531.7533

Published: 01 January 1987 Publication History

PDF eReader

Abstract

Reaching agreement is a primitive of distributed computing. Whereas this poses no problem in an ideal, failure-free environment, it imposes certain constraints on the capabilities of an actual system: A system is viable only if it permits the existence of consensus protocols tolerant to some number of failures. Fischer et al. have shown that in a completely asynchronous model, even one failure cannot be tolerated. In this paper their work is extended: Several critical system parameters, including various synchrony conditions, are identified and how varying these affects the number of faults that can be tolerated is examined. The proofs expose general heuristic principles that explain why consensus is possible in certain models but not possible in others.

References

[1]

AGHILI, H., ASTRAHAN, M., FINKELSTEIN, S., KIM, W., MCPHERSON, J., SCHKOLNICK, M., AND STRONG, R. A prototype for a highly available database system. Rep. RJ 3755, IBM Research Division, San Jose, Calif., 1983.

Google Scholar

[2]

ATTIYA, C., DOLEV, D., AND GIL, J. Asynchronous Byzantine consensus. In Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 27-29). ACM, New York, 1984, pp. 119-133.

Crossref

Google Scholar

[3]

BEN-OR, M. Another advantage of free choice: Completely asynchronous agreement protocols. In Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing (Montreal, Quebec, Canada, Aug. 17-19). ACM, New York, 1983, pp. 27-30.

Crossref

Google Scholar

[4]

BEN-OR, M. Fast asynchronous Byzantine agreement. In Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing (Minaki, Ontario, Canada, Aug. 5-7). ACM, New York, 1985, pp. 149-151.

Crossref

Google Scholar

[5]

BRACHA, G. An asynchronous t(n - 1)/3.I-resilient consensus protocol. In Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 27-29). ACM, New York, 1984, pp. 154-162.

Crossref

Google Scholar

[6]

DOLEV, D., AND REmCHUK, R. Bounds on information exchange for Byzantine agreement. In Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (Ottawa, Canada, Aug. 18-20). ACM, New York, 1982, pp. 132-140.

Crossref

Google Scholar

[7]

DOLEV, D., AND STRONG, H. R. Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12 (1983), 656-666.

Google Scholar

[8]

DOLEV, D., REISCHUK, R., AND STRONG, H.R. Eventual is earlier than immediate. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (Chicago, I11., Nov. 3-5). IEEE, New York, 1982, pp. 196-203.

Google Scholar

[9]

DWORK, C., LYNCH, L., AND STOCKMEYER, L. Consensus in the presence of partial synchrony. IBM Res. Rep. RJ 4892, IBM Research Division, San Jose, Calif., Oct. 1985.

Google Scholar

[10]

FISCHER, M. J., LYNCH, N. A., AND PATERSON, M.S. Impossibility of distributed consensus with one faulty process. J. ACM 32 (1985), 374-382.

Crossref

Google Scholar

[11]

LAMPORT, L., SHOSTAK, R., AND PEASE, M. The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 3 (July 1982), 382-401.

Crossref

Google Scholar

[12]

PEASE, M., SHOSTAK, R., AND LAMPORT, L. Reaching agreement in the presence of faults, j. ACM 27, 2 (Apr. 1980), 228-234.

Crossref

Google Scholar

[13]

RAmN, M.O. Randomized Byzantine generals. In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (Tucson, Ariz., Nov. 7-9). IEEE, New York, pp. 403-409.

Crossref

Google Scholar

[14]

TOUEG, S. Randomized Byzantine agreements. In Proceedings of the 3rdAnnualACMSymposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 27-29). ACM, New York, 1984, pp. 163-178.

Crossref

Google Scholar

Cited By

View all

Amiri MAgrawal DEl Abbadi ALoo BBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Distributed Transaction Processing in Untrusted EnvironmentsCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654684(570-579)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654684
Barroso-Fernández CJiménez ELópez-Presa JMoreno-Cuesta MXulvi-Brunet R(2024)Optimizing Gossiping for Asynchronous Fault-Prone IoT Networks With Memory and Battery ConstraintsIEEE Access10.1109/ACCESS.2023.334902112(4701-4715)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2023.3349021
Chaurasia BVerma AVerma P(2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2024.110432247:COnline publication date: 18-Jul-2024
https://dl.acm.org/doi/10.1016/j.comnet.2024.110432
Show More Cited By

Index Terms

On the minimal synchronism needed for distributed consensus

Recommendations

On the minimal synchronism needed for distributed consensus
SFCS '83: Proceedings of the 24th Annual Symposium on Foundations of Computer Science

Reaching agreement is a primitive of distributed computing. While this poses no problem in an ideal, failure-free environment, it imposes certain constraints on the capabilities of an actual system: a system is viable only if it permits the existence of ...
Minimal Synchrony for Byzantine Consensus
PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing

Solving the consensus problem requires in one way or another that the underlying system satisfies some synchrony assumption. Considering an asynchronous message-passing system of n processes where (a) up to t< n/3 may commit Byzantine failures, and (b) ...
Resilient distributed consensus
MobiHoc '12: Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing

Consensus algorithms allow a set of nodes to reach an agreement on a quantity of interest. For instance, a consensus algorithm may be used to allow a network of sensors to determine the average value of samples collected by the different sensors. ...

Reviews

Reviewer: Greg Speegle

Reaching agreement in the presence of failures by a distributed system is an interesting problem. This paper defines the conditions that are sufficient for agreement to occur and some conditions that make agreement impossible. The paper identifies five important components of a distributed system and constructs a favorable and an unfavorable condition for each component. Proofs are presented that show the resiliency possible under the 32 possible combinations of conditions of the components. The paper is very formal and contains many proofs. These proofs are presented in an organized style, but the notation required to present them is difficult to read. The primary value of this work is the clear definitions of what is and is not possible in reaching agreement. Of course, as in any case analysis, some systems may not fit the model used perfectly; but with the techniques presented and the broad range of situations covered, one could derive similar results for other works with relatively easy proofs.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 34, Issue 1

Jan. 1987

219 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/7531

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1987

Published in JACM Volume 34, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

468
Total Citations
View Citations
2,177
Total Downloads

Downloads (Last 12 months)167
Downloads (Last 6 weeks)27

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Amiri MAgrawal DEl Abbadi ALoo BBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Distributed Transaction Processing in Untrusted EnvironmentsCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654684(570-579)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654684
Barroso-Fernández CJiménez ELópez-Presa JMoreno-Cuesta MXulvi-Brunet R(2024)Optimizing Gossiping for Asynchronous Fault-Prone IoT Networks With Memory and Battery ConstraintsIEEE Access10.1109/ACCESS.2023.334902112(4701-4715)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2023.3349021
Chaurasia BVerma AVerma P(2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2024.110432247:COnline publication date: 18-Jul-2024
https://dl.acm.org/doi/10.1016/j.comnet.2024.110432
Freitas ARodrigues LDuarte E(2024)vCubeChainAd Hoc Networks10.1016/j.adhoc.2024.103461158:COnline publication date: 1-May-2024
https://dl.acm.org/doi/10.1016/j.adhoc.2024.103461
Allam AGomaa IZayed HTaha M(2024)IoT-based eHealth using blockchain technology: a surveyCluster Computing10.1007/s10586-024-04357-yOnline publication date: 4-Apr-2024
https://doi.org/10.1007/s10586-024-04357-y
Zhang GPan FMao YTijanic SDang’ana MMotepalli SZhang SJacobsen H(2023)Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus AlgorithmsACM Computing Surveys10.1145/363655356:5(1-41)Online publication date: 9-Dec-2023
https://dl.acm.org/doi/10.1145/3636553
Frey DMostefaoui APerrin MRoman PTaïani F(2023)Differentiated Consistency for Worldwide GossipsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.320915034:1(1-15)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TPDS.2022.3209150
Wang GNixon M(2023)SoK: Essentials of BFT Consensus for Blockchains2023 Fifth International Conference on Blockchain Computing and Applications (BCCA)10.1109/BCCA58897.2023.10338868(315-328)Online publication date: 24-Oct-2023
https://doi.org/10.1109/BCCA58897.2023.10338868
Attiya HCastañeda ARajsbaum S(2023)Locally solvable tasks and the limitations of valency argumentsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2023.02.002176:C(28-40)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1016/j.jpdc.2023.02.002
Srinivasan SRamesh K(2023)Asynchronous Consensus in Synchronous Systems Using send_to_all PrimitiveSN Computer Science10.1007/s42979-023-02216-y4:6Online publication date: 12-Oct-2023
https://dl.acm.org/doi/10.1007/s42979-023-02216-y
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Abstract

References

Cited By

Index Terms

Recommendations