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)
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)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Structured derivations of consensus algorithms for failure detectors
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Information Processing Letters
k-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Eventually consistent failure detectors
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Optimal Implementation of the Weakest Failure Detector for Solving Consensus
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A necessary and sufficient condition for transforming limited accuracy failure detectors
Journal of Computer and System Sciences
Failure detection and consensus in the crash-recovery model
Distributed Computing
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership
IEEE Transactions on Parallel and Distributed Systems
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
Towards the minimal synchrony for byzantine consensus
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
From an intermittent rotating star to a leader
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal message-driven implementations of omega with mute processes
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
The Asynchronous Bounded-Cycle Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Implementing the Omega failure detector in the crash-recovery failure model
Journal of Computer and System Sciences
Proceedings of the 2009 ACM symposium on Applied Computing
Partial synchrony based on set timeliness
Proceedings of the 28th ACM symposium on Principles of distributed computing
Stabilizing leader election in partial synchronous systems with crash failures
Journal of Parallel and Distributed Computing
A simple and communication-efficient Omega algorithm in the crash-recovery model
Information Processing Letters
OPODIS '09 Proceedings of the 13th 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
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
Byzantine consensus with few synchronous links
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
From an intermittent rotating star to a leader
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Robust stabilizing leader election
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
When consensus meets self-stabilization
Journal of Computer and System Sciences
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
The Asynchronous Bounded-Cycle model
Theoretical Computer Science
Communication-efficient leader election in crash-recovery systems
Journal of Systems and Software
Journal of Parallel and Distributed Computing
When consensus meets self-stabilization
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing leader election in networks of finite-state anonymous agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Revisiting failure detection and consensus in omission failure environments
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Ω meets paxos: leader election and stability without eventual timely links
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Algorithms for extracting timeliness graphs
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Specifying and implementing an eventual leader service for dynamic systems
International Journal of Web and Grid Services
On the implementation of communication-optimal failure detectors
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
Communication-Efficient self-stabilization in wireless networks
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 0.01 |
We study the degree of synchrony required to implement the leader election failure detector Ω and to solve consensus in partially synchronous systems. We show that in a system with n processes and up to f process crashes, one can implement Ω and solve consensus provided there exists some (unknown) correct process with f outgoing links that are eventually timely. In the special case where f = 1 , an important case in practice, this implies that to implement Ω and solve consensus it is sufficient to have just one eventually timely link -- all the other links in the system, Θ(n2) of them, may be asynchronous. There is no need to know which link p → q is eventually timely, when it becomes timely, or what is its bound on message delay. Surprisingly, it is not even required that the source p or destination q of this link be correct: either p or q may actually crash, in which case the link p → q is eventually timely in a trivial way, and it is useless for sending messages. We show that these results are in a sense optimal: even if every process has f - 1 eventually timely links, neither Ω nor consensus can be solved. We also give an algorithm that implements Ω in systems where some correct process has f outgoing links that are eventually timely, such that eventually only f links carry messages, and we show that this is optimal. For f = 1 , this algorithm ensures that all the links, except for one, eventually become quiescent.