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

STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing

Pages 359 - 369

https://doi.org/10.1145/103418.103457

Published: 03 January 1991 Publication History

PDF eReader

References

[1]

H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg and It. l#eischuk, "l#enaming in an Asynchronous Environment," YACM, Vol. 37, No. 3 (July 1990), pp. 524-548.

Digital Library

Google Scholar

[2]

H. Attiya, C. Dwork, N. Lynch, and L. Stockmeyer, #'Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty," Report TM-435, Laboratory fo# Computer Science, MIT. Also: IBM l#ese#rch l#eport 1#J7853.

Google Scholar

[3]

H. Attiya and N. Lynch, "Time Bounds for P#eal-Time Process Control in the Presence of Timing Uncertainty," Proc. l Oth {EEE Real- Time Systems Symposium, 1989, pp. 268- 284. Also: Technical Memo MIT/LCS/TM- 403, Laboratory for Computer Science, MIT, July 1989.

Crossref

Google Scholar

[4]

H. Attiya and M. Mavronicolas, "Efficieacy of Asynchronous vs. Semi-Synchronous Networks," 28th Allerton Conf. on Communication, Control and Computing, October 1990. Also: Technical P#eport 21-90, Department of Computer Science, Harvard University, September 1990.

Google Scholar

[5]

F. Cfisti#n, H. Aghili, t#. Strong and D. Dolev, "Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement," Proc. i5th Int. Conf. on Fault Tolerant Computing, 1985, pp. 1-7. Also: IBM Research Report t#J5244, revised October 1989.

Google Scholar

[6]

B. A. Coan and C. Dwork, "Simultaneity is Harder th#n Agreement," Proc. 5th IEEE Symp. on Reliability in Distributed Software and Database Systems, 1986, pp. 141-150.

Google Scholar

[7]

B. A. Coan znd G. Thomas, "Agreeing on a Le#der in P#eal-Time," Proc. 11th IEEE Real- Time Systems Symposium, 1990.

Google Scholar

[8]

P#. DeMillo, N. Lynch and M. Merfitt, "Cryptogr#phic Protocols," Proc. I#th Annual A CM Syrup. on Theory of Computing, May 1982, pp. 383-400.

Digital Library

Google Scholar

[9]

D. Dolev, C. Dwoik and L. Stockmeyer, "On the Minimal Synchronism Needed for Distfibuted Consensus," JACM, Vol. 34, No. 1 (January 1987), pp. 77-97.

Digital Library

Google Scholar

[10]

D. Dolev, 1#. R.eischuk, and H. R. Strong, "Early Stopping in Byzantine Agreement," JACM, Vol. 37, No. 4 (Oct. 1990), pp. 720- 741.

Digital Library

Google Scholar

[11]

D. Dolev #nd H. P#. Strong, "Authenticated Algorithms for Byzantine Agreement," SIAM J. on Computing, Vol. 12, No. 4 (November 1983), pp. 656-666.

Crossref

Google Scholar

[12]

C. Dwork, N. Lynch and L. Stockmeyer, "Consensus in the Presence of Parti#l Synchrony," JACM, Vol. 35 (1988), pp. 288-323.

Digital Library

Google Scholar

[13]

C. Dwork and Y. Moses, "Know}:.edge #nd Common Knowledge in a Byzantine Environment: Cr#sh Failures," Information and Computation, Vol. 88, No. 2 (1990), pp. 156- 186.

Digital Library

Google Scholar

[14]

C. Dwork #nd L. Stockmeyer, "Bounds on the Time to l#each Agreement as # Function of Message Del#y," IBM Research t#eport, in preparation.

Google Scholar

[15]

M. Fischer and N. Lynch, "A Lower Bound for the Time to Assure Interactive Consistency," Information Processing Letters,- Vol. 14, No. 4 (june 1982), pp. 183-186.

Crossref

Google Scholar

[16]

M. Fischer, N. Lynch #nd M. P#terson, "impossibility of Distributed Consensus with One Faulty Process," JACM, Vol. 32, No. 2 (1985), pp. 374-382.

Digital Library

Google Scholar

[17]

V. Hadzilacos, Issues of Fault Tolerance in Concurrent Computations, Ph.I). Thesis, Harvard University, June 1984. Technical l#eport T1#-11-84, Department of Computer Science, H#rvard University.

Digital Library

Google Scholar

[18]

M. Herlihy #nd M. Tuttle, "Wait-Free Computation in Message-Passing Systems," Proc. 9th A CM Syrup. on Principles of Distributed Computing, 1990, pp. 347-362.

Digital Library

Google Scholar

[19]

A. Herzberg and S. Kutten, "Efficient Detection of Message Forwarding Faults," Proc. 8th A CM Symp. on Principles of Distributed Computing, 1989, pp. 339-353.

Digital Library

Google Scholar

[20]

L. L#mport and M. Fischer, "Byzantine Generals and Transaction Commit Protocols," Tech. Report Op. 62, SRI International, Menlo Park, CA, 1982.

Google Scholar

[21]

L. Lamport, 1#. Shostak and M. Pease, "The Byzantine Generals Problem," A CM Trans. on Prog. Lang. and Sys., Vol. 4, No. 3 (July 1982), pp. 382-401.

Digital Library

Google Scholar

[22]

M. Merritt, "Notes on the Dolev-Strong Lower Bound for Byzantine Agreement," unpublished manuscript, 1985.

Google Scholar

[23]

Y. Moses and M. Turtle, "Programming Simultaneous Actions Using Common Knowledge," Algorithm#ca, Vol. 3 (1988), pp. 121- 169.

Digital Library

Google Scholar

[24]

M. Pease, P#. Shost#k #nd L. Lamport, "l#e#ching Agreement in the Presence of Faults," JACM, Vol. 27, No. 2 (1980), pp. 228-234.

Digital Library

Google Scholar

[25]

S. Ponzio, "KeM-time Analysis of Timingbased Distributed Algorithms," MS thesis, in progress, MIT Electrical Engineering #nd Computer Science, 1990.

Google Scholar

[26]

B. Simons, J. L. Welch #nd N. Lynch, "An Overview of Clock Synchronization," Proceedings of IBM Fault-Tolerant Computing Workshop, M#rch, 1986.

Digital Library

Google Scholar

[27]

P#. Strong, D. Dolev and F. Cristi#n, "New Latency Bounds for Atomic Bro#dc#t," Proc. I l th IEEE Real-Time Systems Symposium, 1990.

Google Scholar

Cited By

View all

Crouzen PHahn EHermanns HDhama ATheel OWimmer RBraitling BBecker B(2011)Bounded Fairness for Probabilistic Distributed AlgorithmsProceedings of the 2011 Eleventh International Conference on Application of Concurrency to System Design10.1109/ACSD.2011.21(89-97)Online publication date: 20-Jun-2011
https://dl.acm.org/doi/10.1109/ACSD.2011.21
Merritt MTaubenfeld G(2006)Fairness of shared objectsDistributed Computing10.1007/BFb0056491(303-317)Online publication date: 2-Jun-2006
https://doi.org/10.1007/BFb0056491
Kutten S(2005)Scalable fault toleranceSOFSEM'96: Theory and Practice of Informatics10.1007/BFb0037411(286-306)Online publication date: 26-Jun-2005
https://doi.org/10.1007/BFb0037411
Show More Cited By

Index Terms

Bounds on the time to reach agreement in the presence of timing uncertainty
1. Theory of computation

Recommendations

Bounds on the time to reach agreement in the presence of timing uncertainty
Bounds on the time to reach agreement in the presence of timing uncertainty
Adaptive timeliness of consensus in presence of crash and timing faults

The @D-timed uniform consensus is a stronger variant of the traditional consensus and it satisfies the following additional property: every correct process terminates its execution within a constant time @D (@D-timeliness), and no two processes decide ...

Comments

Information & Contributors

Information

Published In

STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing

January 1991

572 pages

ISBN:0897913973

DOI:10.1145/103418

Chairmen:
Cris Koutsougeras
Tulane Univ., New Orleans, LA
,
Jeff Vitter
Brown Univ., Providence, RI

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC91

Sponsor:

SIGACT

STOC91: 23rd Annual ACM Symposium on Theory of Computing

May 5 - 8, 1991

Louisiana, New Orleans, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
364
Total Downloads

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

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Crouzen PHahn EHermanns HDhama ATheel OWimmer RBraitling BBecker B(2011)Bounded Fairness for Probabilistic Distributed AlgorithmsProceedings of the 2011 Eleventh International Conference on Application of Concurrency to System Design10.1109/ACSD.2011.21(89-97)Online publication date: 20-Jun-2011
https://dl.acm.org/doi/10.1109/ACSD.2011.21
Merritt MTaubenfeld G(2006)Fairness of shared objectsDistributed Computing10.1007/BFb0056491(303-317)Online publication date: 2-Jun-2006
https://doi.org/10.1007/BFb0056491
Kutten S(2005)Scalable fault toleranceSOFSEM'96: Theory and Practice of Informatics10.1007/BFb0037411(286-306)Online publication date: 26-Jun-2005
https://doi.org/10.1007/BFb0037411
Attiya HDjerassi-Shintel T(2005)Time bounds for decision problems in the presence of timing uncertainty and failuresDistributed Algorithms10.1007/3-540-57271-6_37(204-218)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57271-6_37
Berman PBharali A(2005)Quick atomic broadcastDistributed Algorithms10.1007/3-540-57271-6_36(189-203)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57271-6_36
Bazzi RNeiger G(2005)Simulating crash failures with many faulty processors (extended abstract)Distributed Algorithms10.1007/3-540-56188-9_12(166-184)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-56188-9_12
Alur RAttiya HTaubenfeld GLeighton FGoodrich M(1994)Time-adaptive algorithms for synchronizationProceedings of the twenty-sixth annual ACM symposium on Theory of Computing10.1145/195058.195464(800-809)Online publication date: 23-May-1994
https://dl.acm.org/doi/10.1145/195058.195464
Alur RHenzinger TVardi MKosaraju RJohnson DAggarwal A(1993)Parametric real-time reasoningProceedings of the twenty-fifth annual ACM symposium on Theory of Computing10.1145/167088.167242(592-601)Online publication date: 1-Jun-1993
https://dl.acm.org/doi/10.1145/167088.167242
Bharali ABerman P(1993)Distributed consensus with general omission failures and timing uncertaintyProceedings of Phoenix Conference on Computers and Communications10.1109/PCCC.1993.344468(168-174)Online publication date: 1993
https://doi.org/10.1109/PCCC.1993.344468
Rhee IWelch JHutchinson N(1992)The impact of time on the session problemProceedings of the eleventh annual ACM symposium on Principles of distributed computing10.1145/135419.135459(191-202)Online publication date: 1-Oct-1992
https://dl.acm.org/doi/10.1145/135419.135459
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

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

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

Adaptive timeliness of consensus in presence of crash and timing faults