Automatic Classification of Eventual Failure Detectors

DOI10.1007/978-3-540-75142-7_35MaRDI QIDQ3523229zbMATH OpenOpenAlexFDO

Authors Piotr Zieliński

Publication date 2 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75142-7_35

Mathematics Subject Classification ID

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

Recommendations

• Asynchronous failure detectors
• The weakest failure detector for eventual consistency
• The weakest failure detector for eventual consistency
• Failure detectors are schedulers
• The failure detector abstraction

Cited in

(13)

• On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection
• The failure detector abstraction
• The weakest failure detector for eventual consistency
• On the weakest failure detector ever
• The Weakest Failure Detector for Message Passing Set-Agreement
• Eventually Perfect Failure Detectors Using ADD Channels
• Renaming and the weakest family of failure detectors
• The weakest failure detector for eventual consistency
• On set consensus numbers
• The minimum information about failures for solving non-local tasks in message-passing systems
• scientific article; zbMATH DE number 2086947 (Why is no real title available?)
• Anti-\(\Omega \): the weakest failure detector for set agreement
• Implementing P with bounded messages on a network of ADD channels

This page was built for publication: Automatic Classification of Eventual Failure Detectors

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