A fast contention-friendly binary search tree

DOI10.1142/S0129626416500158MaRDI QIDQ4598927zbMATH OpenOpenAlexFDO

Authors Tyler Crain, Vincent Gramoli, Michel Raynal

Publication date 15 December 2017

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129626416500158

zbMATH Keywords

binary treeconcurrent data structuresefficient implementation

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms (68W40)

Recommendations

• Efficient lock-free binary search trees
• CBTree: a practical concurrent self-adjusting search tree
• The CB tree: a practical concurrent self-adjusting search tree
• Chromatic binary search trees: A structure for concurrent rebalancing
• scientific article; zbMATH DE number 2033285

Cited in

(5)

• The CB tree: a practical concurrent self-adjusting search tree
• Efficient lock-free binary search trees
• CBTree: a practical concurrent self-adjusting search tree
• Order out of chaos: proving linearizability using local views
• A template for implementing fast lock-free trees using HTM

This page was built for publication: A fast contention-friendly binary search tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598927)