On the weakest failure detector ever

DOI10.1007/S00446-009-0079-3MaRDI QIDQ2377264zbMATH OpenOpenAlexFDO

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

Publication date 28 June 2013

Published in 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

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• Anti-Ω
• Atomic snapshots of shared memory
• Automatic Classification of Eventual Failure Detectors
• Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement
• Failure detectors and the wait-free hierarchy (extended abstract)
• Failure detectors as type boosters
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Impossibility of distributed consensus with one faulty process
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Mutual exclusion in asynchronous systems with failure detectors
• On the minimal synchronism needed for distributed consensus
• On the weakest failure detector ever
• Robust wait-free hierarchies
• Structured derivations of consensus algorithms for failure detectors
• The asynchronous computability theorem for t-resilient tasks
• The weakest failure detector for solving consensus
• The weakest failure detectors to solve certain fundamental problems in distributed computing
• Unreliable failure detectors for reliable distributed systems
• Wait-free k-set agreement is impossible
• Weakening Failure Detectors for k-Set Agreement Via the Partition Approach

Cited in

(18)

• On the hardness of failure-sensitive agreement problems.
• Renaming and the weakest family of failure detectors
• The weakest failure detector for eventual consistency
• Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems
• The weakest failure detector for eventual consistency
• The failure detector abstraction
• Every problem has a weakest failure detector
• Sharing is harder than agreeing
• The Weakest Failure Detectors to Boost Obstruction-Freedom
• On Set Consensus Numbers
• Extracting quorum failure detectors
• The weakest failure detector for solving k-set agreement
• On the weakest failure detector ever
• The weakest failure detectors to solve certain fundamental problems in distributed computing
• ``\(\varGamma\)-accurate failure detectors
• On set consensus numbers
• The minimum information about failures for solving non-local tasks in message-passing systems
• Anti-\(\Omega \): the weakest failure detector for set agreement

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 Q2377264)