How Fast Can Eventual Synchrony Lead to Consensus?

Authors:
Affiliations:
Venue:
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Year:
2005

Citing 0
Cited 4

Self-stabilizing byzantine agreement

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Timeliness, failure-detectors, and consensus performance

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Local Terminations and Distributed Computability in Anonymous Networks

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Relating stabilizing timing assumptions to stabilizing failure detectors regarding solvability and efficiency

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well known that the consensus problem can be solved in a distributed system if, after some time T_S, no process fails and there is some upper bound 驴 on how long it takes to deliver a message. We know of no existing algorithm that guarantees consensus among N processes before time T_S + O(N驴). We show that consensus can be achieved by time T_S + O(驴).