Anti- : the weakest failure detector for set agreement

DOI10.1007/S00446-010-0101-9MaRDI QIDQ992506zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Anti-Ω
• The Weakest Failure Detector for Message Passing Set-Agreement
• The weakest failure detector for solving \(k\)-set agreement
• On the road to the weakest failure detector for k-set agreement in message-passing systems
• On the weakest failure detector ever

Cites work

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

Cited in

(13)

• Set agreement power is not a precise characterization for oblivious deterministic anonymous objects
• On implementing omega with weak reliability and synchrony assumptions
• Anti-Ω
• Wait-freedom with advice
• The Weakest Failure Detector for Message Passing Set-Agreement
• Partial synchrony based on set timeliness
• Renaming and the weakest family of failure detectors
• The Iterated Restricted Immediate Snapshot Model
• Partial synchrony based on set timeliness
• A separation of \(n\)-consensus and \((n+1)\)-consensus based on process scheduling
• The disagreement power of an adversary
• On set consensus numbers
• The minimum information about failures for solving non-local tasks in message-passing systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992506)