On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Unreliable failure detectors for asynchronous systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed 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)
Distributed Algorithms
Distributed Consensus in Semi-Synchronous Systems
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Failure Detection and Consensus in the Crash-Recovery Model
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Consensus in Asynchronous Systems Where Processes Can Crash and Recover
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Hi-index | 0.00 |
We revisit the work of Chandra and Toueg on achieving consensus using unreliable failure detectors in an asynchronous system with crash stop failures. Following a brief review of their approach, we provide a probabilistic analysis of their consensus algorithm, which shows that the number of messages is exponentially proportional to the number of participating processes n. Based on our analysis, we study how their solution may be improved when we have a priori knowledge of the maximum number of process failures that may occur. Accordingly, we propose multi-level consensus as a generalization of the Chandra-Toueg algorithm, and give a probabilistic analysis of our algorithm. For n large relative to the bound on the number of failures k, this approach yields an improvement (in the expected case) in the message complexity.