A communication-efficient canonical form for fault-tolerant distributed protocols
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Exploiting virtual synchrony in distributed systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Reasoning about knowledge
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)
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version)
Proceedings of the 3rd International Workshop on Distributed Algorithms
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Distributed Computing
| Hi-index | 0.00 |
It is shown that, in a precise sense, if there is no bound on the number of faulty processes in a system with unreliable but fair communication, Uniform Distributed Coordination (UDC) can be attained if and only if a system has perfect failure detectors. This result is generalized to the case where there is a bound t on the number of faulty processes. It is shown that a certain type of generalized failure detector is necessary and sufficient for achieving UDC in a context with at most t faulty processes. Reasoning about processes' knowledge as to which other processes are faulty plays a key role in the analysis.