Wait-Free Synchronization

@article{Herlihy1991WaitFreeS,
  title={Wait-Free Synchronization},
  author={Maurice Herlihy},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1991},
  volume={13},
  pages={124-149}
}
A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another lies at the heart of much recent work in concurrent algorithms, concurrent data structures, and multiprocessor architectures. First, we introduce a simple and general technique, based on reduction to a… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 1,224 CITATIONS

Life Beyond Set Agreement

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Robust multithreaded applications

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The Anonymous Consensus Hierarchy and Naming Problems

  • OPODIS
  • 2007
VIEW 20 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1984
2019

CITATION STATISTICS

  • 193 Highly Influenced Citations

  • Averaged 44 Citations per year from 2017 through 2019

References

Publications referenced by this paper.