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

Authors:
Yonatan Aumann;Michael A. Bender
Affiliations:
Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, Israel and Harvard University;Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY and Harvard University
Venue:
Distributed Computing
Year:
2005

Citing 20
Cited 8

On the minimal synchronism needed for distributed consensus

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
Flipping persuasively in constant time

SIAM Journal on Computing
Fast randomized consensus using shared memory

Journal of Algorithms
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
Clock construction in fully asynchronous parallel systems and PRAM simulation

Theoretical Computer Science - Special issue on dependable parallel computing
Wait-Free Consensus Using Asynchronous Hardware

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

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
Efficient asynchronous consensus with the weak adversary scheduler

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Contention in shared memory algorithms

Journal of the ACM (JACM)
Efficient execution of nondeterministic parallel programs on asynchronous systems

Information and Computation
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
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
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
Randomized protocols for asynchronous consensus

Distributed Computing - Papers in celebration of the 20th anniversary of PODC

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
Lower bounds for randomized consensus under a weak adversary

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

Journal of the ACM (JACM)
Locally scalable randomized consensus for synchronous crash failures

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
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
Tight bounds for anonymous adopt-commit objects

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Lower Bounds for Randomized Consensus under a Weak Adversary

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider asynchronous consensus in the shared-memory setting. We present the first efficient low-contention consensus algorithm for the weak-adversary-scheduler model. The algorithm achieves consensus in O(n log2 n) total work and O(log n) (hot-spot) contention, both expected and with high probability. The algorithm assumes the value-oblivious scheduler, which is defined in the paper. Previous efficient consensus algorithms for weak adversaries suffer from Ω(n) memory contention.