'Eventual' is earlier than 'immediate'

Authors:
Danny Dolev;Ruediger Reischuk;H. Raymond Strong
Affiliations:
-;-;-
Venue:
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Year:
1982

Citing 0
Cited 6

Continuous Consensus with Failures and Recoveries

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Self-stabilizing Byzantine digital clock synchronization

SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Continuous consensus with ambiguous failures

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Optimum simultaneous consensus for general omissions is equivalent to an NP oracle

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Continuous consensus with ambiguous failures

Theoretical Computer Science
Early-deciding consensus is expensive

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

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.