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)
Revising the Weakest Failure Detector for Uniform Reliable Broadcast
Proceedings of the 13th International Symposium on Distributed Computing
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Proceedings of the 13th International Symposium on Distributed Computing
Global data computation in chordal rings
Journal of Parallel and Distributed Computing
Detecting failures in distributed systems with the Falcon spy network
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Failure detection with booting in partially synchronous systems
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Hi-index | 0.00 |
In this paper we study the implementability of different classes of failure detectors in several models of partial synchrony. We show that no failure detector with perpetual accuracy (namely, P, Q, S, and W) can be implemented in any of the models of partial synchrony proposed in [3] and [5] in systems with even a single failure. We also show that, in these models of partial synchrony, it is necessary a majority of correct processes to implement a failure detector of class Θ.