MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Fast Randomized Consensus using Shared Memory (1988) [102 citations — 27 self]

by James Aspnes ,  Maurice Herlihy
Journal of Algorithms
Add To MetaCart

Abstract:

We give a new randomized algorithm for achieving consensus among asynchronous processes that communicate by reading and writing shared registers. The fastest previously known algorithm has exponential expected running time. Our algorithm is polynomial, requiring an expected O(n 4 ) operations. Applications of this algorithm include the elimination of critical sections from concurrent data structures and the construction of asymptotically unbiased shared coins.

Citations

1040 An Introduction to Probability Theory and Its Applications, Volume I, 3rd Edition – Feller - 1968
318 M.: Hierarchical correctness proofs for distributed algorithms – Lynch, Tuttle - 1987
307 Consensus in the Presence of Partial Synchrony – Dwork, Lynch, et al. - 1988
194 On the minimal synchronism needed for distributed consensus – Dolev, Dwork, et al. - 1987
153 Another advantage of free choice: completely asynchronous agreement protocols (extended abstract – Ben-Or - 1983
132 Memory requirements for agreement among unreliable asynchronous processes – Loui, Abu-Amara - 1987
128 Randomized Byzantine generals, in – Rabin - 1983
96 Concurrent reading and writing – Lamport - 1977
78 Axioms for concurrent objects – Wing - 1987
72 On achieving consensus using a shared memory – Abrahamson - 1988
71 Concurrent reading while writing – Peterson - 1983
70 Impossibility and universality results for wait-free synchronization – Herlihy
67 Efficient Synchronization on Multiprocessors with Shared Memory – Kruskal, Rudolph, et al. - 1988
64 On processor coordination using asynchronous hardware – Chor, Israeli, et al. - 1987
64 Optimal Algorithms for Byzantine Agreement – Feldman - 1988
62 Constructing two-writer atomic registers – Bloom - 1988
56 Constructing multi-reader atomic values from non-atomic values – Burns, Peterson - 1987
52 Impossibility of distributed commit with one faulty process – Fischer, Lynch, et al. - 1985
52 Concurrent reading while writing ii: The multi-writer case – Peterson, Burns - 1987
35 ªOn Interprocess Communication, Part II – Lamport - 1986
33 Introduction to the Theory of Nested Transactions – Lynch, Merrit
32 A protocol for wait-free, atomic, multi-reader shared variables – Newman-Wolfe - 1987
31 The elusive atomic register, revisited – Singh, Anderson, et al. - 1987
29 An O(log n) expected rounds randomized Byzantine generals protocol – Bracha - 1987
23 Simple Constant-Time Consensus Protocols in Realistic Failure Models – Chor, Merritt, et al. - 1989
20 Collective coin flipping, robust voting schemes and minima of Banzhaf values – Ben-Or, Linial - 1985
18 The virtue of patience: concurrent programming with and without waiting – Anderson, Gouda - 1990
17 A simple and efficient randomized Byzantine agreement algorithm – Chor, Coan - 1996
12 Resilient consensus protocols – Bracha, Toueg - 1983
6 Flipping Persuasively in Constant Expected Time – Dwork, Shmoys, et al. - 1986
5 Dolev: Flipping coins in many pockets (Byzantine agreement on uniformly random values – Broder, Danny - 1984
2 Transaction commit in a realistic fault model – Coan, Welch - 1986
View or Download | Add to My Collection | Correct Errors