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)
Failure detectors and the wait-free hierarchy (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Structured derivations of consensus algorithms for failure detectors
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
The topological structure of asynchronous computability
Journal of the ACM (JACM)
k-set agreement with limited accuracy failure detectors
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
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The inherent price of indulgence
Distributed Computing - Special issue: PODC 02
Tight bounds for k-set agreement with limited-scope failure detectors
Distributed Computing - Special issue: DISC 03
The Alpha of Indulgent Consensus
The Computer Journal
Anti-Ω: the weakest failure detector for set agreement
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The Weakest Failure Detector for Message Passing Set-Agreement
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
The weakest failure detector for solving k-set agreement
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
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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
Weakening failure detectors for k-set agreement via the partition approach
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Easy impossibility proofs for k-set agreement in message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
This paper considers the k-set agreement problem in a crashprone asynchronous message passing system enriched with failure detectors. Two classes of failure detectors have been previously identified as necessary to solve asynchronous k-set agreement: the class anti-leader anti-Ωk and the weak-quorum class Σk. The paper investigates the families of failure detector (anti-Ωx)1≤x≤n and (Σz)1≤z≤n. It characterizes in an n processes system equipped with failure detectors anti-Ωx and Σz for which values of k, x and z k-set-agreement can be solved. While doing so, the paper (1) disproves previous conjunctures about the weakest failure detector to solve k-set-agreement in the asynchronous message passing model and, (2) introduces the first indulgent algorithm that tolerates a majority of processes failures.