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)
"Gamma-Accurate" Failure Detectors
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
(Im)Possibilities of Predicate Detection in Crash-Affected Systems
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A formal approach to designing delay-insensitive circuits
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
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Fault-Tolerant Distributed Clock Generation in VLSI Systems-on-Chip
EDCC '06 Proceedings of the Sixth European Dependable Computing Conference
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
Implementing reliable distributed real-time systems with the Θ-model
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
The Asynchronous Bounded-Cycle Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security 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
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The Asynchronous Bounded-Cycle model
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the complexity of algorithms in message-driven models, i.e., models of distributed computations where events can only be caused by message receptions but not by the passage of time. Hutle and Widder (2005) have shown that there is no self-stabilizing implementation of the eventually strong failure detector, and thus the eventual leader oracle Ω in such models under certain assumptions. Under stronger assumptions it was shown that even the eventually perfect failure detector can be implemented in systems consisting of at least f + 2 processes-- f being the upper bound on the number of processes that crash during an execution. In this paper we show that f + 2 is in fact a lower bound in messagedriven systems, even if non stabilizing algorithms are considered. This contrasts time-driven models where f + 1 is sufficient for failure detector implementations. After that, we provide an efficient message-driven implementation of Ω. Our algorithm is efficient in the sense that not all processes have to send messages forever, which is an improvement to previous message-driven failure detector implementations.