CS 854, Fall 2013 - Scalable Data Structures

Designated Papers

• Scalable Lock-Free Dynamic Memory Allocation
  http://dx.doi.org/10.1145/996841.996848

• Scalable Concurrent Hash Tables via Relativistic Programming
  http://dx.doi.org/10.1145/1842733.1842750

• RadixVM: Scalable address spaces for multithreaded applications
  http://dx.doi.org/10.1145/2465351.2465373

Additional Literature

• Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects
  http://dx.doi.org/10.1109/TPDS.2004.8

• Nonblocking Memory Management Support for Dynamic-Sized Data Structures
  http://dx.doi.org/10.1145/1062247.1062249

• Scalable Address Spaces Using RCU Balanced Trees
  http://dx.doi.org/10.1145/2150976.2150998