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:
- 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…☆181Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- The world's first wait-free Software Transactional Memory☆172Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆173Updated 8 years ago
- W-TinyLFU cache C++11 header only implementation☆60Updated 6 years ago
- QSBR and EBR library☆121Updated 5 years ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆160Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- ☆107Updated last year
- Consistent Hashing data structures and algorithms for C++☆39Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆58Updated last year
- NOPaxos consensus protocol☆135Updated 4 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆141Updated 5 years ago
- The Cicada engine☆57Updated 8 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 4 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago