Fast concurrent lock-free binary search trees
Authors:
Open Access
- 6 February 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 49 (8) , 317-328
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- A Contention-Friendly Binary Search TreeLecture Notes in Computer Science, 2013
- Concurrent Wait-Free Red Black TreesLecture Notes in Computer Science, 2013
- A non-blocking internal binary search tree2012
- Concurrent tries with efficient non-blocking snapshots2012
- Non-blocking k-ary Search Trees2011
- Concurrent programming without locksACM Transactions on Computer Systems, 2007
- Hazard pointers: safe memory reclamation for lock-free objectsIEEE Transactions on Parallel and Distributed Systems, 2004
- A methodology for implementing highly concurrent data objectsACM Transactions on Programming Languages and Systems, 1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990