Pragmatic primitives for non-blocking data structures

@inproceedings{Brown2013PragmaticPF,
  title={Pragmatic primitives for non-blocking data structures},
  author={Trevor Brown and Faith Ellen and Eric Ruppert},
  booktitle={PODC},
  year={2013}
}
We define a new set of primitive operations that greatly simplify the implementation of non-blocking data structures in asynchronous shared-memory systems. The new operations operate on a set of Data-records, each of which contains multiple fields. The operations are generalizations of the well-known load-link (LL) and store-conditional (SC) operations called LLX and SCX. The LLX operation takes a snapshot of one Data-record. An SCX operation by a process p succeeds only if no Data-record in a… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

A Template for Implementing Fast Lock-free Trees Using HTM

  • PODC
  • 2017
VIEW 16 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Lock-free Self-adjusting Binary Search Tree

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A general technique for non-blocking trees

VIEW 20 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Fast concurrent lock-free binary search trees

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Non-Blocking Doubly-Linked Lists with Good Amortized Complexity

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Non-blocking Patricia tries with replace operations

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

References

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

Nonblocking k-Compare-Single-Swap

  • Theory of Computing Systems
  • 2008
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

A method for implementing lock-free data structures

G. Barnes
  • In Proc. 5th ACM Symposium on Parallel Algorithms and Architectures, pages 261–270,
  • 1993
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…