Randomized consensus in expected O(n log n) individual work

Authors:
James Aspnes;Hagit Attiya;Keren Censor
Affiliations:
Yale University, New Haven, CT, USA;Technion, Haifa, Israel;Technion, Haifa, Israel
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 13
Cited 8

On achieving consensus using a shared memory

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Fast randomized consensus using shared memory

Journal of Algorithms
Implementing fault-tolerant services using the state machine approach: a tutorial

ACM Computing Surveys (CSUR)
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
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
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
Randomized Consensus in Expected O(n²log n) Operations

WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Randomized protocols for asynchronous consensus

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Tight bounds for asynchronous randomized consensus

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Observing Branching Structure through Probabilistic Contexts

SIAM Journal on Computing

Tight bounds for asynchronous randomized consensus

Journal of the ACM (JACM)
Approximate shared-memory counting despite a strong adversary

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
Approximate shared-memory counting despite a strong adversary

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
Stabilizing consensus with the power of two choices

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Strongly linearizable implementations: possibilities and impossibilities

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new randomized algorithm for achieving consensus among asynchronous processes that communicate by reading and writing shared registers, in the presence of a strong adversary. The fastest previously known algorithm requires a process to perform an expected O(n log2 n) read and write operations in the worst case. In our algorithm, each process executes at most an expected O(n log n) read and write operations. It is shown that shared-coin algorithms can be combined together to yield an algorithm with O(n log n) individual work and O(n2) total work.