On the hardness of failure-sensitive agreement problems
References (6)
- et al.
Unreliable failure detectors for reliable distributed systems
J. ACM
(1996) - et al.
The weakest failure detector for solving consensus
J. ACM
(1996) - E. Fromentin, M. Raynal, F. Tronel, About classes of problems in asynchronous distributed systems with process crashes,...
There are more references available in the full text version of this article.
Cited by (19)
The perfectly synchronized round-based model of distributed computing
2007, Information and ComputationOn the weakest failure detector for hard agreement problems
2003, Journal of Systems ArchitectureCitation Excerpt :In this paper we have presented three new perfect failure detector classes. Our classes are alternatives to the classes P and M, proposed by Chandra and Toueg [1] and Guerraoui [4] respectively. More precisely, two of them are weaker than P and M, and yet can be used to solve non-blocking atomic commitment and terminating reliable broadcast.
Symbolic Model Checking for TLA+ Made Faster
2023, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)An Eventually Perfect Failure Detector on ADD Channels Using Clustering
2022, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Higher-Order Quantifier Elimination, Counter Simulations and Fault-Tolerant Systems
2021, Journal of Automated ReasoningAn Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values
2020, Parallel Processing Letters
Copyright © 2001 Elsevier Science B.V. All rights reserved.