'Eventual' is earlier than 'immediate'
- 1 November 1982
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 196-203
- https://doi.org/10.1109/sfcs.1982.51
Abstract
Two different notions of Byzantine Agreement - immediate and eventually - are defined depending on whether the agreement involves an action to be performed synchronously or not. The lower bounds for time complexity depend on what kind of agreement has to be achieved. All previous algorithms to reach Byzantine Agreement ensure immediate agreement. We present two algorithms that in many cases reach the second type of agreement faster than previously known algorithms showing that there actually is a difference between the two notions: Eventual Byzantine Agreement can be reached earlier than Immediate.Keywords
This publication has 10 references indexed in Scilit:
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983
- The Weak Byzantine Generals ProblemJournal of the ACM, 1983
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982
- Polynomial algorithms for multiple processor agreementPublished by Association for Computing Machinery (ACM) ,1982
- Cryptographic protocolsPublished by Association for Computing Machinery (ACM) ,1982
- Bounds on information exchange for Byzantine AgreementPublished by Association for Computing Machinery (ACM) ,1982
- Unanimity in an unknown and unreliable environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980