On the weakest failure detector ever
From MaRDI portal
Publication:2377264
DOI10.1007/s00446-009-0079-3zbMath1267.68066MaRDI QIDQ2377264
Calvin Newport, Rachid Guerraoui, Petr Kuznetsov, Nancy A. Lynch, Maurice P. Herlihy
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
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
The minimum information about failures for solving non-local tasks in message-passing systems, Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems
Cites Work
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Failure detectors as type boosters
- Mutual exclusion in asynchronous systems with failure detectors
- Structured derivations of consensus algorithms for failure detectors
- Anti-Ω
- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
- 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
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Atomic snapshots of shared memory
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Robust wait-free hierarchies
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Wait-free k-set agreement is impossible
- The asynchronous computability theorem for t-resilient tasks
- Failure detectors and the wait-free hierarchy (extended abstract)
- On the weakest failure detector ever
- The weakest failure detectors to solve certain fundamental problems in distributed computing
