eourcs / LockFreeCuckooHashLinks
A fully concurrent lock-free cuckoo hash table implementation
☆56Updated 8 years ago
Alternatives and similar repositories for LockFreeCuckooHash
Users that are interested in LockFreeCuckooHash are comparing it to the libraries listed below
Sorting:
- W-TinyLFU cache C++11 header only implementation☆60Updated 6 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- A data structure and algorithm library built for TerarkDB☆64Updated 3 years ago
- ☆20Updated 2 years ago
- Adaptive Radix Tree in C++☆45Updated last week
- Generic lock-free Skiplist container pure C implementation, STL-style set, map☆149Updated 5 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
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 2 weeks ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- QSBR and EBR library☆121Updated 5 years ago
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 7 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- ☆44Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆173Updated 8 years ago
- Effective Memory Reclamation☆55Updated 5 years ago
- A SIMD optimized fixed-length string class along with an adaptive hash table for fast searching☆129Updated 3 years ago
- Yet Another RAFT implementation☆126Updated 6 years ago
- Latency collector as an embedded library for C++☆13Updated 6 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Implementaions of concurrent lock-free SPSC queue in c++.☆17Updated 7 years ago
- Library for lock-free locks☆82Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- A data structure and algorithm library built for ToplingDB☆59Updated 2 weeks ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago