A distributed leader election algorithm in crash-recovery and omissive systems
From MaRDI portal
Publication:344564
DOI10.1016/J.IPL.2016.10.007zbMath1392.68440OpenAlexW2548059763MaRDI QIDQ344564
Michel Raynal, Mikel Larrea, Roberto Cortiñas, Christian Fernández-Campusano
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
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (2)
Consensus in anonymous asynchronous systems with crash-recovery and omission failures ⋮ Packet efficient implementation of the Omega failure detector
Cites Work
- 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
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
This page was built for publication: A distributed leader election algorithm in crash-recovery and omissive systems
