Randomized protocols for asynchronous consensus

Authors:
James Aspnes
Affiliations:
Department of Computer Science, Yale University, New Haven, CT
Venue:
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Year:
2003

Citing 47
Cited 29

On the minimal synchronism needed for distributed consensus

Journal of the ACM (JACM)
Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
On achieving consensus using a shared memory

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Sticky bits and universality of consensus

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Bounded polynomial randomized consensus

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
On the improbability of reaching Byzantine agreements

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Fast randomized consensus using shared memory

Journal of Algorithms
The best of both worlds: guaranteeing termination in fast randomized Byzantine agreement protocols

Information Processing Letters
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal time randomized consensus—making resilient algorithms fast in practice

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Time- and space-efficient randomized consensus

Journal of Algorithms
A methodology for implementing highly concurrent data objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fast asynchronous Byzantine agreement with optimal resilience

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounds on the time to reach agreement in the presence of timing uncertainty

Journal of the ACM (JACM)
Wait-Free Consensus Using Asynchronous Hardware

SIAM Journal on Computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Asynchronous consensus and broadcast protocols

Journal of the ACM (JACM)
Software transactional memory

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Computing with faulty shared objects

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Randomized Consensus in Expected O(n log^ 2 n) Operations Per Processor

SIAM Journal on Computing
Polylog randomized wait-free consensus

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-Adaptive Algorithms for Synchronization

SIAM Journal on Computing
Determining consensus numbers

PODC '97 Proceedings of the sixteenth 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
Failure detectors in omission failure environments

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

SIAM Journal on Computing
Robust wait-free hierarchies

Journal of the ACM (JACM)
Consensus numbers of multi-objects

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)
Fault-tolerant wait-free shared objects

Journal of the ACM (JACM)
Wait-free synchronization in multiprogrammed systems: integrating priority-based and quantum-based scheduling

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus

SIAM Journal on Computing
The power of multiobjects

Information and Computation
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Fast deterministic consensus in a noisy environment

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Time-Lapse Snapshots

SIAM Journal on Computing
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
Wait-free consensus with infinite arrivals

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Randomized Consensus in Expected O(n²log n) Operations

WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
On the Importance of Having an Identity or is Consensus Really Universal?

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Correctness Proof of Ben-Or''s Randomized Consensus Algorithm

Correctness Proof of Ben-Or''s Randomized Consensus Algorithm
Failure detection and consensus in the crash-recovery model

Distributed Computing

ACM SIGACT news distributed computing column 13

ACM SIGACT News
Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler

Distributed Computing
Switched PIOA: parallel composition via distributed scheduling

Theoretical Computer Science - Components and objects
Tight bounds for asynchronous randomized consensus

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the complexity of asynchronous gossip

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Lower bounds for randomized consensus under a weak adversary

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Randomized consensus in expected O(n log n) individual work

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Tight bounds for asynchronous randomized consensus

Journal of the ACM (JACM)
Randomized mutual exclusion in O(log N / log log N) RMRs

Proceedings of the 28th ACM symposium on Principles of distributed computing
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
Combining shared-coin algorithms

Journal of Parallel and Distributed Computing
Adaptive randomized mutual exclusion in sub-logarithmic expected time

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
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
Linearizable implementations do not suffice for randomized distributed computation

Proceedings of the forty-third annual ACM symposium on Theory of computing
Random walks, interacting particles, dynamic networks: randomness can be helpful

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Lower Bounds for Randomized Consensus under a Weak Adversary

SIAM Journal on Computing
Asynchronous perfectly secure communication over one-time pads

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Brief announcement: performance analysis of cyclon, an inexpensive membership management for unstructured p2p overlays

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Randomized wait-free consensus using an atomicity assumption

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Optimal randomized fair exchange with secret shared coins

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
A tight RMR lower bound for randomized mutual exclusion

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Coalescing random walks and voting on graphs

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
RMR-efficient randomized abortable mutual exclusion

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Asynchronous gossip

Journal of the ACM (JACM)
Brief announcement: byzantine agreement with a strong adversary in polynomial expected time

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The famous Fischer, Lynch, and Paterson impossibility proof shows that it is impossible to solve the consensus problem in a natural model of an asynchronous distributed system if even a single process can fail. Since its publication, two decades of work on fault-tolerant asynchronous consensus algorithms have evaded this impossibility result by using extended models that provide (a) randomization, (b) additional timing assumptions, (c) failure detectors, or (d) stronger synchronization mechanisms than are available in the basic model. Concentrating on the first of these approaches, we illustrate the history and structure of randomized asynchronous consensus protocols by giving detailed descriptions of several such protocols.