Article

Free access

A tight lower bound for randomized synchronous consensus

Authors:

Ziv Bar-Joseph,

Michael Ben-OrAuthors Info & Claims

PODC '98: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing

Pages 193 - 199

https://doi.org/10.1145/277697.277733

Published: 01 June 1998 Publication History

PDF eReader

References

[1]

J. Aspnes. Lower bounds for distributed coinflipping and randomized consensus. In Proceedings of the 29th Annual A CM Symposium on Theory of Computing, pages 559-568. ACM, 1997.

Digital Library

Google Scholar

[2]

M. Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In Proceedings of the 2nd Annual ACM Symposium on the Principles of Distributed Computing, pages 27-30, 1983.

Digital Library

Google Scholar

[3]

M. Ben-Or and N. Linial. Collective coin flipping. In Advances in Computing Research 5: Randomness and Computation, pages 91-115. JAI Press, 1989.

Google Scholar

[4]

B. Chor and B. Coan. A simple and efficient randomized byzantine agreement algorithm. IEEE Trans. on Software Engineering, SE-11(6):531- 539, 1985.

Digital Library

Google Scholar

[5]

B. Chor and C. Dwork. Randomization in byzantine agreement. In Advances in Computing Research 5: Randomness and Computation, pages 443-497. JAI Press, 1989.

Google Scholar

[6]

Benny Chor, Michael Merritt, and David B. Shmoys. Simple constant-time consensus protocols in realistic failure models. Journal of the ACA/{, 36(3):591-614, 1989.

Digital Library

Google Scholar

[7]

M. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the A UM, 32(2), 1985.

Digital Library

Google Scholar

[8]

P. Feldman and S. Micali. An optimal probabilistic protocol for synchronous byzantine agreement. SIAM Journal on Computing, 26, 1997.

Digital Library

Google Scholar

[9]

J. A. Garay and Y. Moses. Fully polynomial byzantine agreement in t+l rounds. In Proceedings of the 25th Annual A CM Symposium on Theory of Uomputing, pages 31-41. ACM, 1993.

Digital Library

Google Scholar

[10]

N. Linial. Game theoretic aspects of computing. In Handbook of Game Theory, volume 2, pages 1339-1395. Elsevier Science, 1994.

Google Scholar

[11]

Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.

Digital Library

Google Scholar

[12]

M.O. Rabin. Randomized byzantine generals. In Proceedings of the 2dth Annual {EEE Symposium on the Foundations of Computer Science, pages 403-409. IEEE, 1983.

Digital Library

Google Scholar

[13]

G. Schechtman. L~vy type inequality for a class of finite metric spaces. In Lecture Notes in Mathematics: Martingle Theory in Harmonic Analysis and Banach Spaces, volume 939, pages 211-215. Springer-Verlag, 1981.

Google Scholar

Cited By

View all

Hajiaghayi MKowalski DOlkowski JKuznetsov PGelles ROlivetti D(2024)Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662826(321-331)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662826
Mandyal KMahato D(2024)Adaptive Consensus: Enhancing Robustness in Dynamic EnvironmentsAdvanced Information Networking and Applications10.1007/978-3-031-57853-3_7(74-84)Online publication date: 10-Apr-2024
https://doi.org/10.1007/978-3-031-57853-3_7
Chlebus BKowalski DOlkowski JOshman RNolin AHalldorsson MBalliu A(2023)Deterministic Fault-Tolerant Distributed Computing in Linear Time and CommunicationProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594599(344-354)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594599
Show More Cited By

Index Terms

A tight lower bound for randomized synchronous consensus

Recommendations

A tight lower bound for the worst case of Bottom-Up-Heapsort

Bottom-Up-Heapsort is a variant of Heapsort. Its worst-case complexity for the number of comparisons is known to be bounded from above by 3/2n logn+0(n), wheren is the number of elements to be sorted. There is also an example of a heap which needs 5/4n ...
Lower Bounds for Randomized Exclusive Write PRAMs

In this paper we study the question: How useful is randomization in speeding up Exclusive Write PRAM computations? Our results give further evidence that randomization is of limited use in these types of computations. First we examine a compaction ...
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 ...

Comments

Information & Contributors

Information

Published In

PODC '98: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing

June 1998

334 pages

ISBN:0897919777

DOI:10.1145/277697

Chairmen:
Brian Coan
Bellcore
,
Yehuda Afek
Tel-Aviv Univ.

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: 01 June 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC98

Sponsor:

PODC98: Seventeenth Annual ACM Symposium on Principles of Distributed Computing

June 28 - July 2, 1998

Puerto Vallarta, Mexico

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
821
Total Downloads

Downloads (Last 12 months)158
Downloads (Last 6 weeks)14

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hajiaghayi MKowalski DOlkowski JKuznetsov PGelles ROlivetti D(2024)Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662826(321-331)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662826
Mandyal KMahato D(2024)Adaptive Consensus: Enhancing Robustness in Dynamic EnvironmentsAdvanced Information Networking and Applications10.1007/978-3-031-57853-3_7(74-84)Online publication date: 10-Apr-2024
https://doi.org/10.1007/978-3-031-57853-3_7
Chlebus BKowalski DOlkowski JOshman RNolin AHalldorsson MBalliu A(2023)Deterministic Fault-Tolerant Distributed Computing in Linear Time and CommunicationProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594599(344-354)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594599
Kumar MMolla A(2023)On the Message Complexity of Fault-Tolerant Computation: Leader Election and AgreementIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.3239993(1-12)Online publication date: 2023
https://doi.org/10.1109/TPDS.2023.3239993
Hajiaghayi MKowalski DOlkowski JLeonardi SGupta A(2022)Improved communication complexity of fault-tolerant consensusProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520078(488-501)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520078
Huang SPettie SZhu LLeonardi SGupta A(2022)Byzantine agreement in polynomial time with near-optimal resilienceProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520015(502-514)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520015
Chlebus BKowalski DOlkowski JMilani AWoelfel P(2022)Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication EfficiencyProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538471(106-108)Online publication date: 20-Jul-2022
https://dl.acm.org/doi/10.1145/3519270.3538471
Maji H(2020)Computational Hardness of Collective Coin-Tossing ProtocolsEntropy10.3390/e2301004423:1(44)Online publication date: 30-Dec-2020
https://doi.org/10.3390/e23010044
Bolfing A(2020)Cryptographic Primitives in Blockchain Technology10.1093/oso/9780198862840.001.0001Online publication date: 22-Oct-2020
https://doi.org/10.1093/oso/9780198862840.001.0001
Goldreich O(2019)On some noncryptographic works of Goldwasser and MicaliProviding Sound Foundations for Cryptography10.1145/3335741.3335761(527-542)Online publication date: 4-Oct-2019
https://dl.acm.org/doi/10.1145/3335741.3335761
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.

Cited By

Index Terms

Recommendations

A tight lower bound for the worst case of Bottom-Up-Heapsort

Lower Bounds for Randomized Exclusive Write PRAMs

A tight lower bound for k-set agreement

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

A tight lower bound for the worst case of Bottom-Up-Heapsort

Lower Bounds for Randomized Exclusive Write PRAMs

A tight lower bound for k-set agreement

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations