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
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
A simple proof of the uniform consensus synchronous lower bound
Information Processing Letters
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
Local Terminations and Distributed Computability in Anonymous Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A topological treatment of early-deciding set-agreement
Theoretical Computer Science
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the number of synchronous rounds sufficient for authenticated byzantine agreement
DISC'09 Proceedings of the 23rd international conference on Distributed computing
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Generating fast indulgent algorithms
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
A topological treatment of early-deciding set-agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Anonymous agreement: the janus algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
An indulgent algorithm is a distributed algorithm that tolerates asynchronous periods of the network when process crash detection is unreliable. This paper presents a tight bound on the time complexity of indulgent consensus algorithms.We consider a round-based eventually synchronous model, and we show that any t-resilient consensus algorithm in this model, requires at least t + 2 rounds for a global decision even in runs that are synchronous. We contrast our lower bound with the well-known t + 1 round tight bound on consensus in the synchronous model. We then prove the bound to be tight by exhibiting a new t-resilient consensus algorithm in the eventually synchronous model 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 know of, which requires 2t + 2 rounds in synchronous runs.Our lower bound applies to round-based consensus algorithms with unreliable failure detectors such as ⋄P and ⋄S, and our matching algorithm can be adapted to such failure detectors.