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- and latency-optimized log structured merge tree☆174Updated 13 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- NOPaxos consensus protocol☆136Updated 4 years ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- The Cicada engine☆58Updated 8 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- QSBR and EBR library☆121Updated 5 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 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
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 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
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- LSM-trie☆114Updated 4 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- A benchmark to compare synchronization techniques for multicore programming☆343Updated last month
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Consistent Hashing data structures and algorithms for C++☆39Updated 8 years ago
- ☆66Updated 4 years ago