jfuentes / concurrent-data-structuresLinks
Compilation of concurrent data structures with at least lock-free or wait-free properties.
☆75Updated 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
Sorting:
- 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
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- High-performance multicore-scalable data structures and benchmarks☆140Updated 5 years ago
- ☆20Updated 2 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆159Updated 3 years ago
- Fast linearizability checker☆66Updated 9 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 3 years ago
- QSBR and EBR library☆119Updated 5 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆214Updated 2 years ago
- The SprayList data structure☆33Updated 8 years ago
- ☆119Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆95Updated 5 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- A simple, reference implementation of a B^e-tree☆152Updated 6 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 4 years ago
- Benchmark of common hash functions☆36Updated 5 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
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- NOPaxos consensus protocol☆135Updated 4 years ago
- The Cicada engine☆57Updated 7 years ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago