Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Optimal Implementation of the Weakest Failure Detector for Solving Consensus
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
The concept of unreliable failure detecto was introduced by Chandra and Toueg [2] as a mechanism that provides (possibly incorrect) information about process failures. This mechanism has been used to solve different problems in async hronous systems, in particular the Consensus problem.In this paper, we present a new class of unreliable failure detectors, which we call Eventually Consistent and denote by ♦C. This class adds to the failure detection capabilities of other classes an eventual leader election capability. We study the relationship between ♦C and other classes of failure detectors. We also propose an efficient algorithm to transform ♦C into ♦P. Finally, to show the power of this new class of failure detectors, we present an efficient Consensus algorithm based on ♦C. Due to space limitation, the reader is referred to [4] for an in-depth presentation of the algorithms. Here, we only present their general idea.