On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Simple constant-time consensus protocols in realistic failure models
Journal of the ACM (JACM)
Renaming in an asynchronous environment
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Polylog randomized wait-free consensus
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Efficient asynchronous consensus with the weak adversary scheduler
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A tight lower bound for randomized synchronous consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Lower bounds for distributed coin-flipping and randomized consensus
Journal of the ACM (JACM)
Cooperative sharing and asynchronous consensus using single-reader single-writer registers
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
A Layered Analysis of Consensus
SIAM Journal on Computing
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Byzantine agreement in the full-information model in O(log n) rounds
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fault-Tolerant Distributed Computing in Full-Information Networks
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Tight bounds for asynchronous randomized consensus
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized wait-free consensus using an atomicity assumption
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Tight bounds for asynchronous randomized consensus
Journal of the ACM (JACM)
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed agreement with optimal communication complexity
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
The contest between simplicity and efficiency in asynchronous byzantine agreement
DISC'11 Proceedings of the 25th international conference on Distributed computing
On the complexity of asynchronous agreement against powerful adversaries
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Byzantine agreement in polynomial expected time: [extended abstract]
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the probability that an f-resilient randomized consensus algorithm of n processes does not terminate with agreement within k(n-f) steps is at least 1/ck, for some constant c. The lower bound holds for asynchronous systems, where processes communicate either by message passing or through shared memory, under a very weak adversary that determines the schedule in advance, without observing the algorithm's actions. This complements algorithms of Kapron et al. (SODA 2008), for message-passing systems, and of Aumann et al. (PODC 1997, Distributed Computing 2005), for shared-memory systems.