| | |
Summary: Fast Randomized Consensus
using Shared Memory
James Aspnes
School of Computer Science
Carnegie-Mellon University
Pittsburgh, PA 15213
Maurice Herlihy
School of Computer Science
Carnegie-Mellon University
Pittsburgh, PA 15213
September 17, 1996
Abstract
We give a new randomizedalgorithmfor achieving consensus among
asynchronous processes that communicatebyreadingandwriting shared
registers. The fastest previously known algorithm has exponential ex-
pected running time. Our algorithm is polynomial, requiring an ex-
pected O(n4) operations. Applications of this algorithm include the
eliminationof critical sections from concurrent data structures and the
construction of asymptotically unbiased shared coins.
1 Introduction
|
