On the road to the weakest failure detector for k-set agreement in message-passing systems
DOI10.1016/J.TCS.2010.11.007zbMATH Open1222.68117OpenAlexW1593125439MaRDI QIDQ555307FDOQ555307
Authors: François Bonnet, Michel Raynal 
Publication date: 22 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.007
Recommendations
- Failure detectors to solve asynchronous \(k\)-set agreement: a glimpse of recent results
- On the computability power and the robustness of set agreement-oriented failure detector classes
- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
- The weakest failure detector for solving \(k\)-set agreement
- Partition approach to failure detectors for \(k\)-set agreement
reduction\(k\)-set agreementwait-freedomasynchronous systemsmessage-passing systemseventual leadersfailure detectorsquorums
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- The topological structure of asynchronous computability
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Generalized FLP impossibility result for t-resilient asynchronous computations
- \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
- On the computability power and the robustness of set agreement-oriented failure detector classes
- Tight bounds for \(k\)-set agreement
- The Weakest Failure Detector for Message Passing Set-Agreement
- Tight failure detection bounds on atomic object implementations
- The weakest failure detectors to solve certain fundamental problems in distributed computing
- Failure detectors and the wait-free hierarchy (extended abstract)
- Tight bounds for \(k\)-set agreement with limited-scope failure detectors
- Failure detectors as type boosters
- Anti-Ω
- Sharing is harder than agreeing
- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
- The Disagreement Power of an Adversary
- The weakest failure detector for solving \(k\)-set agreement
- \(K\)-set agreement with limited accuracy failure detectors
Cited In (16)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Irreducibility and additivity of set agreement-oriented failure detector classes
- Partition approach to failure detectors for \(k\)-set agreement
- On the computability power and the robustness of set agreement-oriented failure detector classes
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
- Anti-Ω
- Failure detectors to solve asynchronous \(k\)-set agreement: a glimpse of recent results
- The Weakest Failure Detector for Message Passing Set-Agreement
- The weakest failure detector for solving \(k\)-set agreement
- Tight bounds for \(k\)-set agreement with limited-scope failure detectors
- Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
- The minimum information about failures for solving non-local tasks in message-passing systems
- A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus
- Anti-\(\Omega \): the weakest failure detector for set agreement
- Which broadcast abstraction captures \(k\)-set agreement?
This page was built for publication: On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555307)
