A practical concurrent binary search tree
Authors:
Open Access
- 9 January 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 45 (5) , 257-268
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the Performance of Contention Managers for Complex Transactional Memory Benchmarks2009
- McRT-STM2006
- Fast and lock-free concurrent priority queues for multi-thread systemsJournal of Parallel and Distributed Computing, 2005
- Performance analysis of BSTs in system softwareACM SIGMETRICS Performance Evaluation Review, 2004
- Software transactional memory for dynamic-sized data structures2003
- Scalable reader-writer synchronization for shared-memory multiprocessors1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990
- Concurrency control in database structures with relaxed balance1987
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972