Fast Randomized Consensus Using Shared Memory

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, due to Abrahamson, has expected running time 2°^\ Our algorithm is polynomial, requiring an expected 0 ( 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. This research was partially sponsored by the Office of Naval Research (DOD), under Contract N00014-88-K-0641. The work of J. Aspnes was supported by a National Science Foundation Graduate Fellowship. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency, the National Science Foundation or the U.S. government.

DOI: 10.1016/0196-6774(90)90021-6

Extracted Key Phrases

051015'92'95'98'01'04'07'10'13'16
Citations per Year

263 Citations

Semantic Scholar estimates that this publication has 263 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Aspnes1990FastRC, title={Fast Randomized Consensus Using Shared Memory}, author={James Aspnes and Maurice Herlihy}, journal={J. Algorithms}, year={1990}, volume={11}, pages={441-461} }