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
- ☆20Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- ☆53Updated 10 months ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- Transactional Data Structure Libraries☆12Updated 7 years ago
- The Cicada engine☆55Updated 7 years ago
- pmwcas☆136Updated last year
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 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
- Persistent Memory Storage Engine☆24Updated 4 months ago
- ☆43Updated 11 months ago
- NUMA-Aware Reader-Writer Locks☆18Updated 10 years ago
- Artifact for PPoPP'18☆19Updated 2 years ago
- Framework for creating simple, efficient, and composable lock-free data structures☆12Updated 8 years ago
- This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…☆10Updated 5 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- A SQL-to-native-code compiler based on LLVM☆47Updated 9 years ago
- Benchmark of common hash functions☆35Updated 5 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆43Updated last year
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ☆28Updated 2 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆22Updated 9 years ago