Lock-Free Dynamically Resizable Arrays
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 142-156
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Nonblocking memory management support for dynamic-sized data structuresACM Transactions on Computer Systems, 2005
- Allocating Memory in a Lock-Free Manner2005
- A scalable lock-free stack algorithm2004
- CAS-Based Lock-Free Algorithm for Shared Deques2003
- A Practical Multi-word Compare-and-Swap Operation2002
- A Pragmatic Implementation of Non-blocking Linked-lists2001
- Even Better DCAS-Based Concurrent Deques2000
- A methodology for implementing highly concurrent data objectsACM Transactions on Programming Languages and Systems, 1993
- A method for implementing lock-free shared-data structures1993
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990