On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Semisynchrony and Real-Time (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Distributed elections in an archimedean ring of processors
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Defining Liveness
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Optimal message-driven implementation of omega with mute processes
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Brief announcement: chasing the weakest system model for implementing Ω and consensus
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Optimal clock synchronization revisited: upper and lower bounds in real-time systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Failure detection with booting in partially synchronous systems
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Ω meets paxos: leader election and stability without eventual timely links
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Optimal Deterministic Remote Clock Estimation in Real-Time Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Failure detectors encapsulate fairness
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
| Hi-index | 0.00 |
This paper shows how synchrony conditions can be added to thepurely asynchronous model in a way that avoids any reference tomessage delays and computing step times, as well as any globalconstraints on communication patterns and network topology. OurAsynchronous Bounded-Cycle (ABC) model just bounds the ratio of thenumber of forward- and backward-oriented messages in certain("relevant") cycles in the space-time diagram of an asynchronousexecution. We show that clock synchronization and lock-step roundscan easily be implemented and proved correct in the ABC model, evenin the presence of Byzantine failures. We also prove that anyalgorithm working correctly in the partially synchronousθ -Model also works correctly in the ABC model.Finally, we relate our model to the classic partially synchronousmodel, and discuss aspects of its applicability in realsystems.