mit-carbon / Flat-CombiningLinks
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 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
Sorting:
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- QSBR and EBR library☆121Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆154Updated 6 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 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
- The world's first wait-free Software Transactional Memory☆172Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 8 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- The Cicada engine☆57Updated 8 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- ☆20Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- W-TinyLFU cache C++11 header only implementation☆60Updated 6 years ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆75Updated 6 years ago
- Benchmark of common hash functions☆36Updated 5 years ago
- A lock-free priority queue implementation☆34Updated 7 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- pmwcas☆139Updated 2 years ago
- Library for lock-free locks☆82Updated 2 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- An open-source BzTree implementation☆92Updated 3 years ago