Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Time and message efficient reliable broadcasts
Proceedings of the 4th international workshop on Distributed algorithms
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)
ACM Transactions on Computer Systems (TOCS)
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
The inherent price of indulgence
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Proceedings of the 13th International Symposium on Distributed Computing
Resolving message complexity of Byzantine Agreement and beyond
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
Early consensus in an asynchronous system with a weak failure detector
Distributed Computing
On the message complexity of binary byzantine agreement under crash failures
Distributed Computing
Improving Fast Paxos: being optimistic with no overhead
PRDC '06 Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
Fast scalable deterministic consensus for crash failures
Proceedings of the 28th ACM symposium on Principles of distributed computing
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Distributed agreement with optimal communication complexity
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily long periods of asynchrony, and yet perform (asymptotically) optimally in well-behaved, synchronous executions with few failures. We present two such algorithms: In synchronous executions, the first has optimal message complexity, using only O(n) messages, but runs in superlinear time of O(n1+ε). The second has a message complexity of O(n polylog(n)), but has an optimal running time, completing in O(f) rounds in synchronous executions with at most f failures. Both of these results improve significantly over the most message-efficient of previous indulgent consensus algorithms which have a message complexity of at least Ω(n2) in well-behaved executions.