article

Free access

Bounds on the time to reach agreement in the presence of timing uncertainty

Authors:

Hagit Attiya,

Cynthia Dwork,

Nancy Lynch,

Larry StockmeyerAuthors Info & Claims

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

Pages 122 - 152

https://doi.org/10.1145/174644.174649

Published: 02 January 1994 Publication History

PDF eReader

References

[1]

~ATFIYA, H., AND LYNCH, N. A. 1989. Time bounds for real-time process control in the presence ~of timing uncertainty. In Proceedings of the lOth IEEE Real-Time Systems Symposium. IEEE, ~ New York, pp. 268 284. Also Inf. Comput., to appear.

Google Scholar

[2]

~ATTIYA, H., AND MAVRONICOLAS, M. 1990. Efficiency of semi-synchronous versus asynchronous ~networks. In Proceedings of the 28th Annual Allerton Conference on Communication, Control and ~Computing. Univ. Illinois, Urbana-Champaign, Ill. pp. 578-587. Also Math. Syst. Theory, to ~appear.

Google Scholar

[3]

~BERMAN, P., GARAY, J. A., AND PERRY, K. J. 1989. Towards optimal distributed consensus. In ~Proceedings of the 30th IEEE Symposium on Foundattons of Computer Science. IEEE, New York, ~pp. 410-415.

Google Scholar

[4]

~BRACHA, G., AND TOUEG, S. 1985. Asynchronous consensus and broadcast protocols. J. ACM ~32, 4 (Oct.), 824-840.

Crossref

Google Scholar

[5]

~COAN, B. A. 1986. A communication-efficient canonical form for fault-tolerant distributed ~protocols. In Proceedmgs of the 5th ACM Symposi, m on Principles of Distributed Computing, ~ACM, New York, 1986, pp. 63 72. (A revised version of this paper appears as Chapter 2 of ~Coan's {1987} Ph.D. dissertation.)

Crossref

Google Scholar

[6]

~COAN, B. A. 1987. Achieving consensus in fault-tolerant distributed computer systems: Proto- ~cols, lower bounds, and simulation. Ph.D. dissertation. Massachusetts Institute of Technology, ~Cambridge, Mass.

Crossref

Google Scholar

[7]

~COAN, B. A., AND DWORK, C. 1991. Simultaneity is harder than agreement. Inf. Comput. 91, 2, ~ 205-231.

Crossref

Google Scholar

[8]

~COAN, B. A., AND THOMAS, G. 1990. Agreeing on a leader in real-time. In Proceedings of the llth ~ 1EEE Real-Time Systems Symposium. IEEE, New York, pp. 166-172.

Google Scholar

[9]

~CRISTIAN, F., AGHIL1, H., STRONG, H. a., AND DOLEV, D. 1985. Atomic broadcast: From simple ~ message diffusion to Byzantine agreement. In Proceedbzgs of tile 15th hTternational Conference ~on Fault Tolerant Computing. 1985, pp. 1 7. Also: IBM Res. Rep. RJ5244 (revised Apr. 1989).

Google Scholar

[10]

~DEMILLO, R., LYNCH, N. A., AND MERRITr, M. 1982. Cryptographic protocols. In Proceedings of ~the 1~4th Annual ACM Sympostum on Theory of Computing (San Francisco, Calif., May 5-7). ~ ACM, New York, 383-400.

Crossref

Google Scholar

[11]

~DOLEV, D., DWORK, C., AND STOCKMEYER, L. 1987. On the minimal synchronism needed for ~distributed consensus. J. ACM 34, 1 (Jan.), 77-97.

Crossref

Google Scholar

[12]

~DOLEV, D., FISCHER, M. J., FOWLER, R., LYNCH, N. A., AND STRONG, H. R. 1982. Efficient ~Byzantine agreement without authentication. Inf. Contr. 52, 257-274.

Google Scholar

[13]

~DOLEV, D., HALPERN, J. Y., AND STRONG, H. R. 1986. On the possibility and impossibility of ~achieving clock synchronization. J. Comput. Syst. Sci. 32, 2, 230-250.

Crossref

Google Scholar

[14]

~DOLEV, D., REISCHUK, R, AND STRONG, H. R. 1990. Early stopping in Byzantine agreement. ~J. ACM 37, 4 (Oct.), 720-741.

Crossref

Google Scholar

[15]

~DOLEV, D., AND STRONG, H. R. 1983. Authenticated algorithms for Byzantine agreement. SIAM ~J. Compttt. 12, 4, 656-666.

Google Scholar

[16]

~DWORK, C., LYNCH, N., AND STOCKMEYER, L. 1988. Consensus in the presence of partial ~synchrony. J. ACM 35, 2 (Apr.), 288-323.

Crossref

Google Scholar

[17]

~DWORK, C., AND MOSES, Y. 1990. Knowledge and common knowledge in Byzantine environ- ~ments. !: Crash failures. Inf. Comput. 88, 2 (Oct.), 156-186.

Crossref

Google Scholar

[18]

~DWORK, C., AND STOCKMEYER, L. 1991. Bounds on the time to reach agreement as a function of ~message delay. IBM Res. Rep. RJS181. IBM Almaden Research Center, San Jose, Calif.

Google Scholar

[19]

~FISCHER, M. J., AND LYNCH, N. A. 1982. A lower bound for the time to assure interactive ~consistency. Inf. Proc. Lett. 14, 4 (June), 183-186.

Google Scholar

[20]

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

Crossref

Google Scholar

[21]

~HADZILACOS, V. 1984. Issues of fault tolerance in concurrent computations. Ph.D. dissertation. ~Harvard Univ., Cambridge, Mass. Also Tech. Rep. TR-11-84, Dept. Comput. Sci., Harvard ~Univer., Cambridge, Mass.

Crossref

Google Scholar

[22]

~HALPERN, J. Y., MEGIDDO, N., AND MUNSHI, A. A. 1985. Optimal precision in the presence of ~uncertainty, at. Complexity 1, 170-196.

Google Scholar

[23]

~HERZBERG, A., AND KUTTEN, S. 1989. Efficient detection of message forwarding faults. In ~Proceedings of the 8th ACM Symposium on ?ritzcip{es of Distributed Computing (Edmonton, Alb., ~Canada, Aug. 14-16). ACM, New York, pp. 339-353.

Crossref

Google Scholar

[24]

~LAMPORT, L., AND FISCHER, M. J. 1982. Byzantine generals and transaction commit protocols. ~Tech. Rep. Op. 62. SRI International, Menlo Park, Calif.

Google Scholar

[25]

~LAMPORT, L., AND MELLIAR-SMITH, P. 1985. Synchronizing clocks in the presence of faults. ~J. ACM 32, 1 (Jan.), 52-78.

Crossref

Google Scholar

[26]

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

Crossref

Google Scholar

[27]

~LUNDEL1US, J., AND LYNCH, N. 1984. An upper and lower bound for clock synchronization. Inf. ~Contr. 62, 2/3 (Aug./Sept.), 190-204.

Google Scholar

[28]

~MERRrTF, M. 1985. Notes on the Dolev Strong lower bound for Byzantine agreement. Unpub- ~hshed manuscript.

Google Scholar

[29]

~MERRITT, M., MODUGNO, F., AND TUTTLE, M. 1991. Time consnamed automata. In Proceedings ~of CONCUR '91--2nd Intemattonal Conference on Concurrency 7henry (Amsterdam, The ~Netherlands, Aug.). Lecture Notes in Computer Science, vol. 527. Springer-Verlag, New York, ~pp. 408-423.

Crossref

Google Scholar

[30]

~MOSES, Y., AND TUTTLE, M. R. 1988. Programming simultaneous actions using common knowl- ~edge. Algodthmlca 3, 121-169.

Google Scholar

[31]

~MOSES, Y., AND WAARTS, O. 1988. Coordinated traversal: (f + 1)-round Byzantine agreement m ~ polynomial time. In Proceedings oJ the 29th IEEE Sympostum 0;7 Foundations of Computer ~Science. IEEE, New York, pp. 246-255.

Google Scholar

[32]

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

Crossref

Google Scholar

[33]

~PONZIO, S. 1991a Consensus in the presence of timing uncertainty: Omission and Byzantine ~failures. In Proceedings of the lOth ACM Syml?osium on Principles of Dzstnbuted Computing, ~(Montreal, Que., Canada, Aug. 19-21). ACM, New York, pp. 125 138.

Crossref

Google Scholar

[34]

~PONZ~O, S. 1991b. The real-time cost of timing uncertainty: Consensus and failure detection. ~S. M. dissertanon. Report MIT/LCS/TR-518. Laboratory for Computer Science. MIT, Cam- ~bridge, Mass. (Oct.).

Crossref

Google Scholar

[35]

~PONZIO, S., AND STRONG, 14. R. 1992. Semlsynchrony and real time. In Proceedmgs of the 6th ~ Internattonal Workshop on Distrtbuted Algorithms. Lecture Notes in Computer Science, vol. 47. ~Sprmger-Verlag, New York, pp. 120-135.

Crossref

Google Scholar

[36]

~RHEE, 1., AND WELCH, J. L. 1992. The impact of time on the session problem. In Proceedmg3 of ~the J lth ACM Symposium on Princtples of Dtstrihuted Computing. ACM, New York, pp. 191-202.

Crossref

Google Scholar

[37]

~SRIKANTH, T. K., AND TOUEG, S. 1987. Optimal clock synchronization. J. ACM 34, 3 (,July), ~ 626-645.

Crossref

Google Scholar

[38]

~STRONG, R., DOLEV, D., AND CRISTbMN, F. 1990. New latency bounds for atomic broadcast. In ~ Proceedings llth IEEE Real-Trine Systems Symposium. IEEE, New York, pp. 156-165.

Google Scholar

[39]

~WELCH, J. L., AND LYNCH, N. 1988. A new fault-tolerant algorithm for clock synchronization. ~Inf. Comput. 77, 1 (Apr.), 1-36.

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
Zhang GPan FTijanic SJacobsen H(2024)PrestigeBFT: Revolutionizing View Changes in BFT Consensus Algorithms with Reputation Mechanisms2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00156(1930-1943)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00156
Paul SMcCarthy CPatterson SVarela C(2024)Formal Verification of Timely Knowledge Propagation in Airborne NetworksScience of Computer Programming10.1016/j.scico.2024.103184(103184)Online publication date: Aug-2024
https://doi.org/10.1016/j.scico.2024.103184
Show More Cited By

Recommendations

Randomized k-set agreement
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures

The k-Set Agreement problem generalizes the consensus problem (which corresponds to the case k = 1). The processes propose values and each correct process has to decide a value such that (1) a decided value is a proposed value, and (2) no more than k ...
Formally measuring agreement and disagreement in ontologies
K-CAP '09: Proceedings of the fifth international conference on Knowledge capture

Ontologies are conceptual models of particular domains, and domains can be modeled differently, representing different opinions, beliefs or perspectives. In other terms, ontologies may disagree with some particular pieces of information and among ...
All Byzantine Agreement Problems Are Expensive
PODC '24: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing

Byzantine agreement, arguably the most fundamental problem in distributed computing, operates among n processes, out of which t < n can exhibit arbitrary failures. The problem states that all correct (non-faulty) processes must eventually decide (...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 41, Issue 1

Jan. 1994

202 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/174644

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 January 1994

Published in JACM Volume 41, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

51
Total Citations
View Citations
725
Total Downloads

Downloads (Last 12 months)83
Downloads (Last 6 weeks)18

Reflects downloads up to 26 Jan 2025

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
Zhang GPan FTijanic SJacobsen H(2024)PrestigeBFT: Revolutionizing View Changes in BFT Consensus Algorithms with Reputation Mechanisms2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00156(1930-1943)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00156
Paul SMcCarthy CPatterson SVarela C(2024)Formal Verification of Timely Knowledge Propagation in Airborne NetworksScience of Computer Programming10.1016/j.scico.2024.103184(103184)Online publication date: Aug-2024
https://doi.org/10.1016/j.scico.2024.103184
Paul SAgha GPatterson SVarela C(2023)Eventual consensus in Synod: verification using a failure-aware actor modelInnovations in Systems and Software Engineering10.1007/s11334-022-00463-519:4(395-410)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1007/s11334-022-00463-5
Conde RRajsbaum S(2023)The Solvability of Consensus in Iterated Models Extended with Safe-ConsensusTheory of Computing Systems10.1007/s00224-023-10125-z67:5(901-955)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1007/s00224-023-10125-z
Jalalzai MFeng CBusch CRichard GNiu J(2022)The Hermes BFT for BlockchainsIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.311431019:6(3971-3986)Online publication date: 1-Nov-2022
https://doi.org/10.1109/TDSC.2021.3114310
Paul SAgha GPatterson SVarela C(2021)Verification of Eventual Consensus in Synod Using a Failure-Aware Actor ModelNASA Formal Methods10.1007/978-3-030-76384-8_16(249-267)Online publication date: 24-May-2021
https://dl.acm.org/doi/10.1007/978-3-030-76384-8_16
Yin MMalkhi DReiter MGueta GAbraham IRobinson PEllen F(2019)HotStuffProceedings of the 2019 ACM Symposium on Principles of Distributed Computing10.1145/3293611.3331591(347-356)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1145/3293611.3331591
Pass RShi E(2018)Thunderella: Blockchains with Optimistic Instant ConfirmationAdvances in Cryptology – EUROCRYPT 201810.1007/978-3-319-78375-8_1(3-33)Online publication date: 31-Mar-2018
https://doi.org/10.1007/978-3-319-78375-8_1
Pass RShi E(2017)Rethinking Large-Scale Consensus2017 IEEE 30th Computer Security Foundations Symposium (CSF)10.1109/CSF.2017.37(115-129)Online publication date: Aug-2017
https://doi.org/10.1109/CSF.2017.37
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Randomized k-set agreement

Formally measuring agreement and disagreement in ontologies

All Byzantine Agreement Problems Are Expensive

Comments

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Randomized k-set agreement

Formally measuring agreement and disagreement in ontologies

All Byzantine Agreement Problems Are Expensive

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations