rmind / thmap
Concurrent trie-hash map library
☆91Updated last year
Alternatives and similar repositories for thmap:
Users that are interested in thmap are comparing it to the libraries listed below
- QSBR and EBR library☆117Updated 5 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- Adaptive Radix Tree in C++☆41Updated last week
- lock free modified prefix B+tree append-only database☆115Updated 9 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆71Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆55Updated last year
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆99Updated 6 years ago
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- ☆20Updated 2 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- Robin Hood hash map library☆60Updated 3 years ago
- Lock-free slab allocator / freelist.☆65Updated 9 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆157Updated 3 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆74Updated 3 years ago
- The Cicada engine☆55Updated 7 years ago
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 years ago
- AnchorHash - A Scalable Consistent Hash☆25Updated 3 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆43Updated 11 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- An event loop for C using io_uring☆46Updated 10 months ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- Embedded DB Benchmark Framework☆58Updated 4 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆17Updated 5 months ago
- ☆50Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆87Updated 3 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 algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago