Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
A direct lower bound for k-set consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
The Alpha of Indulgent Consensus
The Computer Journal
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
In search of the holy grail: looking for the weakest failure detector for wait-free set agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Simultaneous consensus tasks: a tighter characterization of set-consensus
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Automatic classification of eventual failure detectors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Failure detectors in loosely named systems
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local Maps: New Insights into Mobile Agent Algorithms
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
The weakest failure detector for solving k-set agreement
Proceedings of the 28th ACM symposium on Principles of distributed computing
Partial synchrony based on set timeliness
Proceedings of the 28th ACM symposium on Principles of distributed computing
The disagreement power of an adversary: extended abstract
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: weakest failure detectors via an egg-laying simulation
Proceedings of the 28th ACM symposium on Principles of distributed computing
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
The disagreement power of an adversary
DISC'09 Proceedings of the 23rd international conference on Distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On the existence of weakest failure detectors for mutual exclusion and k-exclusion
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Turning adversaries into friends: simplified, made constructive, and extended
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Hi-index | 0.00 |
In the set agreement problem, n processes have to decide on at most n-1 of the proposed values. This paper shows that the anti-Omega failure detector is both sufficient and necessary to solve set agreement in an asynchronous shared-memory system. Each query to anti-Omega returns a single process id; the specification ensures that there is a correct process whose id is returned only finitely many times.