A simple and communication-efficient omega algorithm in the crash-recovery model

DOI10.1016/j.ipl.2009.10.011zbMath1206.68057OpenAlexW2014040180MaRDI QIDQ990113

Mikel Larrea, Cristian Martín

Publication date: 2 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.10.011

zbMATH Keywords

fault tolerancedistributed computingconsensusleader electioncrash-recoverycommunication-efficient algorithmomega failure detector

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Consensus in anonymous asynchronous systems with crash-recovery and omission failures

Cites Work

• Unnamed Item
• Unnamed Item
• Implementing unreliable failure detectors with unknown membership
• From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation
• Implementing the Omega failure detector in the crash-recovery failure model
• Reducing \(\Omega\) to \(\lozenge\mathcal W\)
• On implementing omega in systems with weak reliability and synchrony assumptions
• On implementing omega with weak reliability and synchrony assumptions
• 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
• Distributed Computing
• Communication-efficient leader election and consensus with limited link synchrony

This page was built for publication: A simple and communication-efficient omega algorithm in the crash-recovery model