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)
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.)
Proceedings of the 13th International Symposium on Distributed Computing
Consensus Based on Failure Detectors with a Perpetual Accuracy Property
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
| Hi-index | 0.00 |
The class of strong failure detectors (denoted S) includes all failure detectors that suspect all crashed processes and that do not suspect some (a priori unknown) process that never crashes. So, a failure detector that belongs to S is intrinsically unreliable as it can arbitrarily suspect correct processes. Several S-based consensus protocols have been designed. Some of them systematically require n computation rounds (n being the number of processes), each round involving n2 or n messages. Others allow early decision (i.e., the number of rounds depends on the maximal number of crashes when there are no erroneous suspicions) but require eac h round to involv en2 messages.This paper presents an early deciding S-based consensus protocol each round of which involv es 3(n - 1) messages. So, the proposed protocol is particularly time and message-efficient.