Consensus in the presence of partial synchrony
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)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
On the Quality of Service of Failure Detectors
IEEE Transactions on Computers
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Proceedings of the 13th International Symposium on Distributed Computing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
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
Eventually consistent failure detectors
Journal of Parallel and Distributed Computing
A Hierarchical Consensus Protocol for Mobile Ad Hoc Networks
PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
The weakest failure detectors to boost obstruction-freedom
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Brief announcement: communication-optimal implementation of failure detector class ⋄P
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Communication-efficient implementation of failure detector classes ♦;Q and ♦;P
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Optimal failure detection with low sporadic overhead and communication locality
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Several algorithms implementing failure detectors have been proposed in the literature. In particular, we have proposed a family of communication-efficient ⋄P algorithms, i.e., algorithms using n links to carry messages forever, being n the number of processes in the system. Moreover, we have recently proposed a ⋄P algorithm that uses only C links, being C the number of correct processes. In this paper, we show that C is the minimum number of links required to implement ⋄P. We also show that, assuming that there is at least one incorrect process, C is optimal not only for ⋄P but also for ⋄S and Ω. We revisit our Reliable Broadcast based communication-optimal ⋄P algorithm, and we show that, regarding QoS measures, it performs better than the communication-efficient algorithms.