Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A simple model for agreement in distributed systems
Fault-tolerant distributed computing
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.)
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
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
Elections in a Distributed Computing System
IEEE Transactions on Computers
| Hi-index | 0.00 |
This paper analyses the leader election problem in terms of the failure detectors in asynchronous distributed systems. A Leader is a Coordinator that supports a set of processes to cooperate a given task. This concept is used in several domains such as distributed systems, parallelism and cooperative support for cooperative work (CSCW). 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.