Concurrent Wait-Free Red Black Trees
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 45-60
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A non-blocking internal binary search tree2012
- A lock-free B+tree2012
- A speculation-friendly binary search tree2012
- Concurrent tries with efficient non-blocking snapshots2012
- A highly-efficient wait-free universal construction2011
- Non-blocking k-ary Search Trees2011
- Non-blocking binary search trees2010
- A universal construction for wait-free transaction friendly data structures2010
- Concurrent cache-oblivious b-trees2005
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991