Asynchronous bounded lifetime failure detectors

DOI10.1016/J.IPL.2004.12.011zbMath1182.68020OpenAlexW2058589511MaRDI QIDQ1041728

Michel Raynal, Roy Friedman, Achour Mostefaoui

Publication date: 4 December 2009

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

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

zbMATH Keywords

fault tolerancefailure detectorprocess crashasynchronous distributed systemunreliable failure detector

Mathematics Subject Classification ID

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

Related Items (2)

The weakest failure detector to implement a register in asynchronous systems with hybrid communication ⋮ A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems

Cites Work

• Sharing memory robustly in message-passing systems
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• On the quality of service of failure detectors
• Non-blocking atomic commit in asynchronous distributed systems with failure detectors
• Distributed Computing
• The weakest failure detectors to solve certain fundamental problems in distributed computing

This page was built for publication: Asynchronous bounded lifetime failure detectors