Implementing unreliable failure detectors with unknown membership

DOI10.1016/j.ipl.2006.05.009zbMath1185.68093OpenAlexW2163915038MaRDI QIDQ845828

N. E. Zubov

Publication date: 29 January 2010

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

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

zbMATH Keywords

fault tolerancecrash failuresmembershipfailure detectors

Mathematics Subject Classification ID

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

Related Items (12)

On implementing omega in systems with weak reliability and synchrony assumptions ⋮ An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values ⋮ Implementing ♢P with Bounded Messages on a Network of ADD Channels ⋮ Partial synchrony based on set timeliness ⋮ Communication-efficient and crash-quiescent omega with unknown membership ⋮ Communication-optimal eventually perfect failure detection in partially synchronous systems ⋮ Failure-aware resource management for high-availability computing clusters with distributed virtual machines ⋮ Consensus in anonymous asynchronous systems with crash-recovery and omission failures ⋮ Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures ⋮ A simple and communication-efficient omega algorithm in the crash-recovery model ⋮ Packet efficient implementation of the Omega failure detector ⋮ Implementing the Omega failure detector in the crash-recovery failure model

Cites Work

• On implementing omega with weak reliability and synchrony assumptions
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus

This page was built for publication: Implementing unreliable failure detectors with unknown membership