Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
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)
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
Synchronous System and Perfect Failure Detector: Solvability and Efficiency Issue
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Local Terminations and Distributed Computability in Anonymous Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A general characterization of indulgence
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Open questions on consensus performance in well-behaved runs
Future directions in distributed computing
Dissecting distributed computations
Future directions in distributed computing
Generating fast indulgent algorithms
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
On the cost of composing shared-memory algorithms
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
On the message complexity of indulgent consensus
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Hi-index | 0.00 |
This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower bound in the unifying framework of round-by-round fault detectors.We show that any ⋄P-based t-resilient consensus algorithm requires at least t + 2 rounds for a global decision even in runs that are synchronous. We then prove the bound to be tight by exhibiting a new ⋄P-based t-resilient consensus algorithm that reaches a global decision at round t + 2 in every synchronous run. Our new algorithm is in this sense significantly faster than the most efficient indulgent algorithm we knew of (which requires 2t + 2 rounds).We contrast our lower bound with the well-known t + 1 round tight lower bound on consensus for the synchronous model, pointing out the price of indulgence.