mit-carbon / Flat-Combining
Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. Flat Combining is a new, efficient synchronization paradigm based on coarse locking.
☆30Updated 13 years ago
Related projects: ⓘ
- NVM Evaluation Testbed☆28Updated 6 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆44Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- The Cicada engine☆56Updated 7 years ago
- ☆20Updated last year
- A fast in-memory key-value store☆49Updated 6 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- Artifact for PPoPP'18☆17Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆26Updated 3 years ago
- Persistent Memory Storage Engine☆24Updated 3 years ago
- MapReduce for multi-core☆48Updated 11 years ago
- Benchmark of common hash functions☆34Updated 5 years ago
- NUMA-Aware Reader-Writer Locks☆18Updated 10 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆37Updated 2 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆47Updated 9 years ago
- pmwcas☆135Updated last year
- A simple, reference implementation of a B^e-tree☆143Updated 5 years ago
- Framework for creating simple, efficient, and composable lock-free data structures☆12Updated 8 years ago
- Benchmarking In-Memory Index Structures☆26Updated 5 years ago
- A C library to support applications that map Non-Volatile Memory into their address space for load/store access.☆56Updated 5 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- Atlas: Programming for Persistent Memory☆74Updated 3 years ago
- Quickstep project☆39Updated 11 months ago
- ☆50Updated 4 months ago
- Experiments in partially ordered SMR.☆45Updated 3 years ago
- ☆27Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆76Updated 2 years ago
- A fork of DBx1000 for Cicada SIGMOD 2017 evaluation☆9Updated 7 years ago
- Self-Tuning Adaptive Radix Tree☆26Updated 4 years ago
- Transactional Data Structure Libraries☆12Updated 6 years ago