On the weakest failure detector ever

DOI10.1145/1281100.1281135MaRDI QIDQ5401416zbMATH OpenOpenAlexFDO

Authors Petr Kuznetsov, Calvin Newport, Rachid Guerraoui, Maurice Herlihy, Nancy Lynch

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.3160

zbMATH Keywords

failure detectorswait-free impossibilitiesset-agreementweakest failure detector ever

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• On the weakest failure detector ever
• The weakest failure detector for solving \(k\)-set agreement
• The weakest failure detector for solving consensus
• On the computability power and the robustness of set agreement-oriented failure detector classes
• The weakest failure detectors to solve certain fundamental problems in distributed computing

Cited in

(13)

• The failure detector abstraction
• The weakest failure detector for eventual consistency
• On the weakest failure detector ever
• The Weakest Failure Detectors to Boost Obstruction-Freedom
• The Weakest Failure Detector for Message Passing Set-Agreement
• Failure detectors as type boosters
• On Set Consensus Numbers
• On the hardness of failure-sensitive agreement problems.
• Sharing is harder than agreeing
• The weakest failure detector for eventual consistency
• Why the Weasel Fails
• On set consensus numbers
• The minimum information about failures for solving non-local tasks in message-passing systems

This page was built for publication: On the weakest failure detector ever

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