Communication-efficient and crash-quiescent omega with unknown membership

DOI10.1016/J.IPL.2010.11.012zbMath1260.68254OpenAlexW1988952411MaRDI QIDQ1944072

Mikel Larrea, Sergio Arévalo, Ernesto Jiménez, Luis Mengual

Publication date: 4 April 2013

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

Full work available at URL: http://oa.upm.es/11243/

zbMATH Keywords

fault tolerancedistributed computingunreliable failure detectors

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Implementing unreliable failure detectors with unknown membership
• On implementing omega with weak reliability and synchrony assumptions
• Eventually Perfect Failure Detectors Using ADD Channels
• Crash-Quiescent Failure Detection
• 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: Communication-efficient and crash-quiescent omega with unknown membership