The Weakest Failure Detector for Message Passing Set-Agreement
From MaRDI portal
Publication:3540224
DOI10.1007/978-3-540-87779-0_8zbMath1161.68331OpenAlexW1959452368MaRDI QIDQ3540224
Carole Delporte-Gallet, Andreas Tielmann, Hugues Fauconnier, Rachid Guerraoui
Publication date: 20 November 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-87779-0_8
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (5)
Anonymous asynchronous systems: the case of failure detectors ⋮ The minimum information about failures for solving non-local tasks in message-passing systems ⋮ On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems ⋮ A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems ⋮ Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems
Cites Work
- Anti-\(\Omega \): the weakest failure detector for set agreement
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Anti-Ω
- Sharing is harder than agreeing
- The topological structure of asynchronous computability
- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
- Automatic Classification of Eventual Failure Detectors
- Sharing memory robustly in message-passing systems
- 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
- Indulgent algorithms (preliminary version)
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Distributed Computing
- On the weakest failure detector ever
This page was built for publication: The Weakest Failure Detector for Message Passing Set-Agreement
