On set consensus numbers

DOI10.1007/s00446-011-0142-8zbMath1231.68075MaRDI QIDQ661057

Eli Gafni, Petr Kuznetsov

Publication date: 6 February 2012

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

Full work available at URL: https://doi.org/10.1007/s00446-011-0142-8

zbMATH Keywords

shared memory; crash failures; failure detector; distributed tasks

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68M14: Distributed systems

Related Items

Partial synchrony based on set timeliness, Renaming and the weakest family of failure detectors

Cites Work

• The disagreement power of an adversary
• Anti-\(\Omega \): the weakest failure detector for set agreement
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Failure detectors as type boosters
• Every problem has a weakest failure detector
• The topological structure of asynchronous computability
• Automatic Classification of Eventual Failure Detectors
• Tight failure detection bounds on atomic object implementations
• The Disagreement Power of an Adversary
• On Set Consensus Numbers
• Time, clocks, and the ordering of events in a distributed system
• 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
• The weakest failure detector for solving k-set agreement
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Wait-free k-set agreement is impossible
• The asynchronous computability theorem for t-resilient tasks
• Randomized wait-free concurrent objects (extended abstract)