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.
☆31Updated 14 years ago
Alternatives and similar repositories for Flat-Combining:
Users that are interested in Flat-Combining are comparing it to the libraries listed below
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- ☆20Updated 2 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- ☆53Updated 11 months ago
- Transactional Data Structure Libraries☆12Updated 7 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- pmwcas☆137Updated 2 years ago
- The Cicada engine☆57Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- NUMA-Aware Reader-Writer Locks☆18Updated 10 years ago
- Persistent Memory Storage Engine☆24Updated 6 months ago
- An open-source BzTree implementation☆92Updated 3 years ago
- A fork of DBx1000 for Cicada SIGMOD 2017 evaluation☆9Updated 7 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- MapReduce for multi-core☆49Updated 11 years ago
- ☆28Updated 2 years ago
- Benchmark of common hash functions☆36Updated 5 years ago
- ☆45Updated last year
- Montage is a system for building fast buffered persistent data structures on nonvolatile memory.☆15Updated 2 years ago
- A C library to support applications that map Non-Volatile Memory into their address space for load/store access.☆56Updated 6 years ago
- A tool for measuring the cache-coherence latencies of a processor (i.e., the latencies of loads, stores, CAS, FAI, TAS, and SWAP).☆78Updated 3 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Implementation of the BwTree as specified by Microsoft Research