Implementing unreliable failure detectors with unknown membership

DOI10.1016/J.IPL.2006.05.009zbMATH Open1185.68093OpenAlexW2163915038MaRDI QIDQ845828FDOQ845828

Authors: 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)

Cites Work

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

Cited In (12)

• On implementing omega in systems with weak reliability and synchrony assumptions
• A simple and communication-efficient omega algorithm in the crash-recovery model
• Consensus in anonymous asynchronous systems with crash-recovery and omission failures
• An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values
• Packet efficient implementation of the Omega failure detector
• Communication-optimal eventually perfect failure detection in partially synchronous systems
• Partial synchrony based on set timeliness
• Communication-efficient and crash-quiescent omega with unknown membership
• Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
• Implementing the Omega failure detector in the crash-recovery failure model
• Failure-aware resource management for high-availability computing clusters with distributed virtual machines
• Implementing \(\lozenge P\) with bounded messages on a network of ADD channels

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845828)