A Concurrency-Optimal Binary Search Tree
- 1 August 2017
- book chapter
- Published by Springer Nature
- p. 580-593
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Fast concurrent lock-free binary search treesACM SIGPLAN Notices, 2014
- A Contention-Friendly Binary Search TreeLecture Notes in Computer Science, 2013
- A speculation-friendly binary search treeACM SIGPLAN Notices, 2012
- On the Cost of Concurrency in Transactional Memory2011
- On the Nature of Progress2011
- Permissiveness in Transactional Memories2008
- A Lazy Concurrent List-Based Set Algorithm2006
- Safe Locking Policies for Dynamic DatabasesJournal of Computer and System Sciences, 1998
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- The serializability of concurrent database updatesJournal of the ACM, 1979