On the road to the weakest failure detector for k-set agreement in message-passing systems

DOI10.1016/J.TCS.2010.11.007MaRDI QIDQ555307zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

reduction\(k\)-set agreementwait-freedomasynchronous systemsmessage-passing systemseventual leadersfailure detectorsquorums

Mathematics Subject Classification ID

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)

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

Cites work

• Anti-Ω
• Failure detectors and the wait-free hierarchy (extended abstract)
• Failure detectors as type boosters
• Generalized FLP impossibility result for t-resilient asynchronous computations
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• On the computability power and the robustness of set agreement-oriented failure detector classes
• Sharing is harder than agreeing
• The Disagreement Power of an Adversary
• The Weakest Failure Detector for Message Passing Set-Agreement
• The topological structure of asynchronous computability
• 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
• Tight bounds for \(k\)-set agreement
• Tight bounds for \(k\)-set agreement with limited-scope failure detectors
• Tight failure detection bounds on atomic object implementations
• Unreliable failure detectors for reliable distributed systems
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
• \(K\)-set agreement with limited accuracy failure detectors
• \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion

Cited in

(16)

• Anti-\(\Omega \): the weakest failure detector for set agreement
• Partition approach to failure detectors for \(k\)-set agreement
• Tight bounds for \(k\)-set agreement with limited-scope failure detectors
• Failure detectors to solve asynchronous \(k\)-set agreement: a glimpse of recent results
• Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
• The weakest failure detector for solving \(k\)-set agreement
• A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus
• Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
• The Weakest Failure Detector for Message Passing Set-Agreement
• Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
• The minimum information about failures for solving non-local tasks in message-passing systems
• Irreducibility and additivity of set agreement-oriented failure detector classes
• On the computability power and the robustness of set agreement-oriented failure detector classes
• Which broadcast abstraction captures \(k\)-set agreement?
• Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
• Anti-Ω

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)