jfuentes / concurrent-data-structures
Compilation of concurrent data structures with at least lock-free or wait-free properties.
☆73Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for concurrent-data-structures
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆176Updated 6 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆171Updated 8 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆47Updated 9 years ago
- Fast linearizability checker☆65Updated 9 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆44Updated 2 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- QSBR and EBR library☆115Updated 4 years ago
- C++ implementation of concurrent Binary Search Trees☆73Updated 9 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆55Updated 7 years ago
- Implementation of the BwTree as specified by Microsoft Research☆98Updated 8 years ago
- High-performance multicore-scalable data structures and benchmarks☆137Updated 5 years ago
- Cross-platform atomic operations and lock algorithm library☆95Updated 6 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 simple, reference implementation of a B^e-tree☆148Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- The world's first wait-free Software Transactional Memory☆168Updated 4 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆97Updated 6 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
- NOPaxos consensus protocol☆133Updated 3 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆148Updated 3 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆214Updated last year
- The Cicada engine☆56Updated 7 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆40Updated 7 years ago
- A transactional main-memory database system on multicores☆101Updated 6 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- pmwcas☆135Updated last year
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 2 years ago