jfuentes / concurrent-data-structures
Compilation of concurrent data structures with at least lock-free or wait-free properties.
☆74Updated 6 years ago
Alternatives and similar repositories for concurrent-data-structures:
Users that are interested in concurrent-data-structures are comparing it to the libraries listed below
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆179Updated 7 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 7 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆213Updated last year
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- ☆116Updated 2 years ago
- QSBR and EBR library☆118Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 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
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆158Updated 3 years ago
- Benchmark of common hash functions☆35Updated 5 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- A simple, reference implementation of a B^e-tree☆152Updated 5 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- ☆20Updated 2 years ago
- Fast linearizability checker☆66Updated 9 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 2 years ago
- A working project for High-concurrency B-tree source code in C☆247Updated 4 years ago