Article

Free access

Fast distributed agreement (preliminary version)

Authors:

Sam Toueg,

Kenneth J. Perry,

T. K. SrikanthAuthors Info & Claims

PODC '85: Proceedings of the fourth annual ACM symposium on Principles of distributed computing

Pages 87 - 101

https://doi.org/10.1145/323596.323604

Published: 01 August 1985 Publication History

PDF eReader

References

[1]

B. Coan, A class of efficient Byzantine Agreement algorithms, Unpublished manuscript.

Google Scholar

[2]

D. Dolev, Unanimity in an unknown and unreliable environment, Proceedings 22nd Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, pp. 159-168, Oct. 1981.

Digital Library

Google Scholar

[3]

D. Dolev and H. R. Strong, Requirements for agreement in a distributed system, Tech. Rep. RJ 3418, IBM Research Laboratory, San Jose, Callfornia, March 1982.

Google Scholar

[4]

D. Dolev, R Reischuck, and H. R. Strong, 'Eventual' is earlier than ~immediate', Proceedings 23rd Symposium on Foundations of Computer Science, Chicago, Illinois, pp. 196-203, November 1982.

Digital Library

Google Scholar

[5]

D. Dolev, M.J. Fischer, R. Fowler, N~. Lynch, R. Strong, An Efficient Byzantine Agreement without authentication, Tech. Rep. RJ 3428, IBM Research Laboratory, San Jose, California, March 1982.

Crossref

Google Scholar

[6]

D. Dolev and H. R. Strong, Authenticated algorithms for Byzantine Agreement, SIAM Journal of Computing, vol. 12, no. 4, pp. 656-666, Nov. 1983.

Crossref

Google Scholar

[7]

V. Hadzilacos, Byzantine Agreement under restricted types of failures ~not telling the truth is different from telling lies), Tech. Rep. 19-83, Aiken Computation Laboratory, Harvard University, Cambridge, Massachusetts, June 1983.

Google Scholar

[8]

L. Lamport and M. Fischer, Byzantine Generals and Transaction Commit protocols, Opus 62, SRI International, April 1982.

Google Scholar

[9]

L. Lamport, R. Shostak, and M. Pease, The Byzantine Generals problem, ACM Transactions on Programming Languages and Systems, vo{. 4, no. 3, pp. 382-401, July 1982.

Digital Library

Google Scholar

[10]

N.A. Lynch, M. J. Fischer~ and R. J. Fowler, A simple and efficient Byzantine Generals algorithm, Proceedings Second {EEE Symposium on Reliability in D~stributed Software and Data Base Systems, Pittsburgh, Pennsylvania, pp. 46-52, 1982.

Crossref

Google Scholar

[11]

M. Pease, R. Shostak and L. Lamport, Reaching agreement in the presence of faults, Journal of the A CM, vol. 27, no. 2, pp. 228-234, April 1980.

Digital Library

Google Scholar

[12]

K.j. Perry and S. Toueg, The Byzantine Monkeys Problem, Tech. Rep. 84-610, Department of Computer Science, Cornell University, {thaca, New York, May 1984.

Google Scholar

[13]

K.J. Perry and S. Toueg, An authenticated Byzantine Generals algorithm with early stopping, Tech. Rep. 84- 620, Department of Computer Science. Cornell University, Ithaca, New York, June 1984.

Google Scholar

[14]

K.J. Pen?, Early stopping protocols for fault-tolerant distributed agreement, Ph.D. thesis, Cornell University, Jan. 1985.

Google Scholar

[15]

R. Reischuk, A new solution for the Byzantine Generals problem, Tech. Rep. RJ 3673, IBM Re,arch Laboratory, San Jose, California, Aug. 1982.

Google Scholar

[16]

A. S. Tanenbaum, Computer Networks, Prentice-Hall software series, 198l.

Digital Library

Google Scholar

[17]

T.K. Srikanth and S. Toueg, Simulating authenticated broadcasts to derive simple fault-tolerant algorithms, Tech. Rep. 84-623, Department of Computer Science, Cornell University, Ithaca, New York, July 1984.

Google Scholar

[18]

T.K. Srikanth and S. Toueg, Optimal Clock Synchronization, Proc. 4th Symposium on the Principles of Distributed Computing, Minaki, Canada, Aug. 1985.

Digital Library

Google Scholar

[19]

S. Toueg, K.J. Perry and T.K. Srikanth, Fast Distributed Agreement, Tech. Rep. 84-621, Department of Computer Science, Cornell University, Ithaca, New York, July 1984.

Google Scholar

Cited By

View all

Cai SYang NMing Z(2018)A Decentralized Sharding Service Network Framework with ScalabilityWeb Services – ICWS 201810.1007/978-3-319-94289-6_10(151-165)Online publication date: 19-Jun-2018
https://doi.org/10.1007/978-3-319-94289-6_10
Luu LNarayanan VZheng CBaweja KGilbert SSaxena PWeippl EKatzenbeisser SKruegel CMyers AHalevi S(2016)A Secure Sharding Protocol For Open BlockchainsProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security10.1145/2976749.2978389(17-30)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2976749.2978389
ORDMAN E(2006) Distributed Graph Recognition with Malicious Faults a Annals of the New York Academy of Sciences10.1111/j.1749-6632.1989.tb16426.x576:1(417-430)Online publication date: 17-Dec-2006
https://doi.org/10.1111/j.1749-6632.1989.tb16426.x
Show More Cited By

Index Terms

Fast distributed agreement (preliminary version)
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical analysis
    1. Mathematical optimization
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization

Recommendations

Fast Byzantine Agreement for Permissioned Distributed Ledgers
SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures

A consensus algorithm lies at the core of every distributed ledger as it defines how the constituent parts of the distributed system ensure that they share identical ledger copies. For a broad range of promising applications of distributed ledger ...
Selecting a distributed agreement algorithm
SAC '07: Proceedings of the 2007 ACM symposium on Applied computing

When component parts of distributed systems need to reach agreement, arriving at consensus is difficult if some components don't behave properly. The Byzantine Generals Problem described by Lamport and others exemplifies the difficulty.

In a real ...
A Condition for k-Set Agreement in Asynchronous Distributed Systems
IPDPS '01: Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS'01) - Volume 1

The k-Set Agreement problem has no solution in fullyasynchronous distributed systems made up of n processes(where at most f of them can crash) when f = k. This pa-perpresents a condition on the occurrence pattern of proposedvalues that allows to solve ...

Comments

Information & Contributors

Information

Published In

PODC '85: Proceedings of the fourth annual ACM symposium on Principles of distributed computing

August 1985

316 pages

ISBN:0897911687

DOI:10.1145/323596

Editors:
Michael Malcolm
Univ. of Waterloo, Waterloo, Ont., Canada
,
Ray Strong
IBM Research, San Jose, CA

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 August 1985

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC05

Sponsor:

PODC05: ACM Symposium on Principles of Distributed Computing

Ontario, Minaki, Canada

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
342
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)7

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cai SYang NMing Z(2018)A Decentralized Sharding Service Network Framework with ScalabilityWeb Services – ICWS 201810.1007/978-3-319-94289-6_10(151-165)Online publication date: 19-Jun-2018
https://doi.org/10.1007/978-3-319-94289-6_10
Luu LNarayanan VZheng CBaweja KGilbert SSaxena PWeippl EKatzenbeisser SKruegel CMyers AHalevi S(2016)A Secure Sharding Protocol For Open BlockchainsProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security10.1145/2976749.2978389(17-30)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2976749.2978389
ORDMAN E(2006) Distributed Graph Recognition with Malicious Faults a Annals of the New York Academy of Sciences10.1111/j.1749-6632.1989.tb16426.x576:1(417-430)Online publication date: 17-Dec-2006
https://doi.org/10.1111/j.1749-6632.1989.tb16426.x
Perry K(2005)A framework for agreementDistributed Algorithms10.1007/BFb0019794(57-75)Online publication date: 16-Jun-2005
https://doi.org/10.1007/BFb0019794
Daliot ADolev DParnas H(2004)Linear Time Byzantine Self-Stabilizing Clock SynchronizationPrinciples of Distributed Systems10.1007/978-3-540-27860-3_4(7-19)Online publication date: 2004
https://doi.org/10.1007/978-3-540-27860-3_4
Moses YWaarts O(1988)Coordinated traversalProceedings of the 29th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1988.21941(246-255)Online publication date: 24-Oct-1988
https://dl.acm.org/doi/10.1109/SFCS.1988.21941

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

Fast Byzantine Agreement for Permissioned Distributed Ledgers

Selecting a distributed agreement algorithm

A Condition for k-Set Agreement in Asynchronous Distributed Systems

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

Fast Byzantine Agreement for Permissioned Distributed Ledgers

Selecting a distributed agreement algorithm

A Condition for k-Set Agreement in Asynchronous Distributed Systems

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