A distributed leader election algorithm in crash-recovery and omissive systems
DOI10.1016/J.IPL.2016.10.007zbMATH Open1392.68440OpenAlexW2548059763MaRDI QIDQ344564FDOQ344564
Authors: Christian Fernández-Campusano, Mikel Larrea, Roberto Cortiñas, Michel Raynal 
Publication date: 23 November 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.10.007
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
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Unreliable failure detectors for reliable distributed systems
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The weakest failure detector for solving consensus
- Implementing the Omega failure detector in the crash-recovery failure model
- Communication-efficient failure detection and consensus in omission environments
- Introduction to Reliable and Secure Distributed Programming
Cited In (5)
- Consensus in anonymous asynchronous systems with crash-recovery and omission failures
- Proactive Leader Election in Asynchronous Shared Memory Systems
- Packet efficient implementation of the Omega failure detector
- A leader election algorithm for dynamic networks with causal clocks
- Stabilizing leader election in partial synchronous systems with crash failures
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)
