Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
On the relationship between the atomic commitment and consensus problems
Fault-tolerant distributed computing
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.)
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
A Simple Model for Agreement in Distributed Systems
Proceedings of the Asilomar Workshop on Fault-Tolerant Distributed Computing
Primary Partition "Virtually-Synchronous Communication" harder than Consensus
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
WDAG '95 Proceedings of the 9th 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
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Elections in a Distributed Computing System
IEEE Transactions on Computers
| Hi-index | 0.00 |
This paper is about the relationship between Election problem and Failure Detector in asynchronous distributed systems. We first discuss the relationship between the Election problem and the Consensus problem in asynchronous distributed systems with unreliable failure detectors. Chandra and Toueg have stated that Consensus is solvable in asynchronous systems with unreliable failure detectors. But, in contrast to the Consensus problem, the Election problem is impossible to solve with unreliable failure detectors even with a single crash failure. More precisely, the weakest failure detector that is needed to solve this problem is a Perfect Failure Detector, which is strictly stronger than the weakest failure detector that is needed to solve Consensus.