The minimum information about failures for solving non-local tasks in message-passing systems
From MaRDI portal
Publication:661069
DOI10.1007/s00446-011-0146-4zbMath1231.68097MaRDI QIDQ661069
Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg
Publication date: 6 February 2012
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-011-0146-4
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
What Can be Computed in a Distributed System?, Perfect failure detection with very few bits, The minimum information about failures for solving non-local tasks in message-passing systems
Cites Work
- The minimum information about failures for solving non-local tasks in message-passing systems
- Anti-\(\Omega \): the weakest failure detector for set agreement
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
- The weakest failure detectors to boost obstruction-freedom
- On the weakest failure detector ever
- Mutual exclusion in asynchronous systems with failure detectors
- Every problem has a weakest failure detector
- The topological structure of asynchronous computability
- A combinatorial characterization of the distributed 1-solvable tasks
- Automatic Classification of Eventual Failure Detectors
- The Weakest Failure Detector for Message Passing Set-Agreement
- Tight failure detection bounds on atomic object implementations
- Impossibility of distributed consensus with one faulty process
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- The weakest failure detectors to solve certain fundamental problems in distributed computing
- Unnamed Item
