A Contention-Friendly Binary Search Tree

@inproceedings{Crain2013ACB,
  title={A Contention-Friendly Binary Search Tree},
  author={Tyler Crain and Vincent Gramoli and M. Raynal},
  booktitle={Euro-Par},
  year={2013}
}
  • Tyler Crain, Vincent Gramoli, M. Raynal
  • Published in Euro-Par 2013
  • Computer Science
  • This paper proposes a new lock-based concurrent binary tree using a methodology for writing concurrent data structures. This methodology limits the high contention induced by today's multicore environments to come up with efficient alternatives to the most widely used search structures. Data structures are generally constrained to guarantee a big-oh step complexity even in the presence of concurrency. By contrast our methodology guarantees the big-oh complexity only in the absence of… CONTINUE READING
    50 Citations

    Figures and Topics from this paper

    A Fast Contention-Friendly Binary Search Tree
    • 5
    • PDF
    Self Adjusting Contention Friendly Concurrent Binary Search Tree by Lazy Splaying
    • 1
    • Highly Influenced
    Contention Adapting Search Trees
    • 11
    • Highly Influenced
    • PDF
    Technical Report : Contention Adapting Search Trees
    • Highly Influenced
    • PDF
    Practical concurrent binary search trees via logical ordering
    • 77
    • Highly Influenced
    • PDF
    A Concurrency-Optimal Binary Search Tree
    • 3
    • PDF
    Fast concurrent lock-free binary search trees
    • 144
    Transactional Interference-Less Balanced Tree
    • 5
    • Highly Influenced
    • PDF
    Practical concurrent traversals in search trees
    • 2
    • PDF
    Transactional Interference-less Balanced Tree Technical Report
    • 1
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 28 REFERENCES
    A practical concurrent binary search tree
    • 192
    • Highly Influential
    • PDF
    A speculation-friendly binary search tree
    • 64
    • PDF
    A Simple Optimistic Skiplist Algorithm
    • 93
    Practical lock-freedom
    • 544
    • PDF
    No Hot Spot Non-blocking Skip List
    • 39
    • PDF
    Non-blocking binary search trees
    • 164
    • PDF
    Cache craftiness for fast multicore key-value storage
    • 278
    • PDF
    High performance dynamic lock-free hash tables and list-based sets
    • 397
    • PDF
    Brief Announcement: A Contention-Friendly, Non-blocking Skip List
    • 8
    The art of multiprocessor programming
    • 810
    • PDF