Concurrent Data Structures

This repository consists a list of papers related to concurrent data structures designed for both volatile and non-volatile indexes. The papers are listed based on year published.

• Volatile Indexes
  • Black-box Concurrent Data Structures for NUMA Architecture (ASPLOS '17)
  • Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures(ASPLOS '15)
  • Scaling Concurrent Log-Structured Data Stores(EuroSys '15)
  • Cache Craftiness for Fast Multicore Key-Value Storage(EuroSys '12)
• Non-volatile Indexes
  • Pronto: Easy and Fast Persistence for VolatileData Structures (ASPLOS '20)
  • Lock Free Concurrent Level Hashing for Persistent Memory(USENIX ATC '20)
  • uTree: A Persistent B+ Tree with Low Latency(VLDB '20)
  • RECIPE: Converting Concurrent DRAM Indexes to Persistent-Memory Indexes(SOSP '19)
  • Write-Optimized Dynamic Hashing for Persistent Memory(FAST '19)
  • Endurable Transient Inconsistency in Byte-Addressable Persistent B+Tree(FAST '18)
  • Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory(OSDI '18)
  • FASTER: A Concurrent Key-Value Store with In-Place Updates(SIGMOD '18)