Anti-\(\Omega \): the weakest failure detector for set agreement

DOI10.1007/s00446-010-0101-9zbMath1231.68099OpenAlexW2005963362MaRDI QIDQ992506

Piotr Zieliński

Publication date: 9 September 2010

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-010-0101-9

zbMATH Keywords

set agreementweakest failure detectorfailure detectorswait-free impossibilities

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (9)

A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling ⋮ Partial synchrony based on set timeliness ⋮ Renaming and the weakest family of failure detectors ⋮ The Iterated Restricted Immediate Snapshot Model ⋮ The Weakest Failure Detector for Message Passing Set-Agreement ⋮ The disagreement power of an adversary ⋮ On set consensus numbers ⋮ The minimum information about failures for solving non-local tasks in message-passing systems ⋮ Wait-freedom with advice

Cites Work

• Unnamed Item
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• The \(k\)-simultaneous consensus problem
• Failure detectors in loosely named systems
• Every problem has a weakest failure detector
• The topological structure of asynchronous computability
• Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
• Automatic Classification of Eventual Failure Detectors
• Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
• Impossibility of distributed consensus with one faulty process
• Three-Processor Tasks Are Undecidable
• The weakest failure detector for solving consensus
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• The weakest failure detector for solving k-set agreement
• Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
• Indulgent algorithms (preliminary version)
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Immediate atomic snapshots and fast renaming

This page was built for publication: Anti-\(\Omega \): the weakest failure detector for set agreement