A distributed leader election algorithm in crash-recovery and omissive systems
From MaRDI portal
(Redirected from Publication:344564)
Recommendations
- Leader election in the presence of n-1 initial failures
- An O(n)-time self-stabilizing leader election algorithm
- Stabilizing leader election in partial synchronous systems with crash failures
- Perfect-Information Leader Election with Optimal Resilience
- A distributed election protocol for unreliable networks
Cites work
- Communication-efficient failure detection and consensus in omission environments
- Implementing the Omega failure detector in the crash-recovery failure model
- Impossibility of distributed consensus with one faulty process
- Introduction to Reliable and Secure Distributed Programming
- Reaching Agreement in the Presence of Faults
- The weakest failure detector for solving consensus
- Unreliable failure detectors for reliable distributed systems
Cited in
(6)- Consensus in anonymous asynchronous systems with crash-recovery and omission failures
- Consensus algorithm based on a new strategy for leader election
- A Paxos based algorithm to minimize the overhead of process recovery in consensus
- A leader election algorithm for dynamic networks with causal clocks
- Stabilizing leader election in partial synchronous systems with crash failures
- Proactive Leader Election in Asynchronous Shared Memory Systems
This page was built for publication: A distributed leader election algorithm in crash-recovery and omissive systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344564)
