Agreement is harder than consensus: set consensus problems in totally asynchronous systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
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
Wait-free k-set agreement is impossible: the topology of public knowledge
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Information Processing Letters
The BG distributed simulation algorithm
Distributed 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
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Anti-Ω: the weakest failure detector for set agreement
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Every problem has a weakest failure detector
Proceedings of the twenty-seventh 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
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
Weakening failure detectors for k-set agreement via the partition approach
DISC'07 Proceedings of the 21st international conference on 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
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
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
DISC'09 Proceedings of the 23rd international conference on Distributed computing
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Asynchronous failure detectors
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact amount of synchrony needed for solving a given distributed computing problem. In this paper, we determine the weakest failure detector for solving k-set agreement among n processes (n k) using reads and writes in shared memory, regardless of the assumptions on when and where failures might occur. This failure detector is derived directly from the impossibility of wait-free k + 1-process k-set agreement. Our approach can be viewed as an extension of the asynchronous BG-simulation technique to partially synchronous systems.