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)
Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Election in Asynchronous Complete Networks with Intermittent Link Failures
IEEE Transactions on Computers
Primary Partition "Virtually-Synchronous Communication" harder than Consensus
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Transaction Model vs. Virtual Synchrony Model: Bridging the Gap
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
On Classes of Problems in Asynchronous Distributed Systems with Process Crashes
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Elections in a Distributed Computing System
IEEE Transactions on Computers
| Hi-index | 0.00 |
So far, the weakest failure detectors had been studied extensively for several of such fundamental problems. It is stated that Perfect Failure Detector P is the weakest failure detector to solve the Election problem with any number of faulty processes. In this paper, we introduce Modal failure detector M and show that to solve Election, M is the weakest failure detector to solve election when the number of faulty processes is less than ⌈n/2 ⌉. We also show that it is strictly weaker than P.