rmind / thmapLinks
Concurrent trie-hash map library
☆92Updated last year
Alternatives and similar repositories for thmap
Users that are interested in thmap are comparing it to the libraries listed below
Sorting:
- QSBR and EBR library☆123Updated 5 years ago
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- Adaptive Radix Tree in C++☆45Updated 3 weeks ago
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Lock-free slab allocator / freelist.☆69Updated 9 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆79Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- Embedded storage benchmarking tool☆139Updated 3 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 4 years ago
- An event loop for C using io_uring☆48Updated last year
- qp tries and crit-bit tries☆121Updated 3 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 4 months ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆41Updated last year
- A simple, intrusive, zero-allocation red-black tree implementation☆52Updated 3 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Robin Hood hash map library☆65Updated 3 years ago
- COW b-trees☆102Updated 7 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
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- Embedded DB Benchmark Framework☆61Updated 4 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Coroutines/Fibers implementation for x86☆65Updated 9 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago