vimpunk / w-tinylfu
W-TinyLFU cache C++11 header only implementation
☆55Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for w-tinylfu
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 7 years ago
- Implementation of the BwTree as specified by Microsoft Research☆98Updated 8 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆27Updated 8 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆172Updated 8 years ago
- ☆21Updated last year
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- Generic lock-free Skiplist container pure C implementation, STL-style set, map☆142Updated 4 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆35Updated last week
- A CPP wrapper for asynchronous socket server using linux's latest IO_URING API☆25Updated 2 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- QSBR and EBR library☆116Updated 4 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆22Updated 9 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆44Updated 2 years ago
- An adaptive radix tree for efficient indexing in main memory.☆150Updated 8 months ago
- The Cicada engine☆56Updated 7 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆97Updated 6 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆74Updated 10 years ago
- An attempt to split the Raft library out of LogCabin☆38Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- network library based on io_uring and C++20 coroutine☆101Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 6 years ago
- A data structure and algorithm library built for TerarkDB☆62Updated 2 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆214Updated last year
- Latency collector as an embedded library for C++☆13Updated 5 years ago
- ☆115Updated 2 years ago
- lock free modified prefix B+tree append-only database☆115Updated 9 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago