A general technique for non-blocking trees

@inproceedings{Brown2014AGT,
  title={A general technique for non-blocking trees},
  author={Trevor Brown and Faith Ellen and Eric Ruppert},
  booktitle={PPOPP},
  year={2014}
}
We describe a general technique for obtaining provably correct, non-blocking implementations of a large class of tree data structures where pointers are directed from parents to children. Updates are permitted to modify any contiguous portion of the tree atomically. Our non-blocking algorithms make use of the LLX, SCX and VLX primitives, which are multi-word generalizations of the standard LL, SC and VL primitives and have been implemented from single-word CAS. To illustrate our technique, we… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 61 CITATIONS, ESTIMATED 97% COVERAGE

Techniques for Constructing Efficient Lock-free Data Structures

  • ArXiv
  • 2017
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Practical concurrent traversals in search trees

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A Template for Implementing Fast Lock-free Trees Using HTM

  • PODC
  • 2017
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way

VIEW 11 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Non-blocking Patricia tries with replace operations

  • Distributed Computing
  • 2019
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A contention adapting approach to concurrent ordered sets

  • J. Parallel Distrib. Comput.
  • 2017
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2013
2019

CITATION STATISTICS

  • 17 Highly Influenced Citations

  • Averaged 9 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Jr

M. Spiegel, P. F. Reynolds
  • Lock-free multiway search trees. In Proc. 39th International Conference on Parallel Processing, pages 604–613,
  • 2010
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

A lock-free B+tree

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A dichromatic framework for balanced trees

  • 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
  • 1978
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…