rmind / libqsbrLinks
QSBR and EBR library
☆127Updated 5 years ago
Alternatives and similar repositories for libqsbr
Users that are interested in libqsbr are comparing it to the libraries listed below
Sorting:
- Concurrent trie-hash map library☆92Updated last year
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- Cross-platform atomic operations and lock algorithm library☆99Updated 7 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆63Updated last year
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- A benchmark framework for concurrent queue implementations☆293Updated 5 years ago
- Our open source benchmarks and code samples☆193Updated 2 months ago
- A working project for High-concurrency B-tree source code in C☆251Updated 5 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- COW b-trees☆103Updated 7 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆250Updated 3 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆141Updated 2 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 3 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- LSM-trie☆114Updated 4 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆139Updated 5 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- Generic lock-free Skiplist container pure C implementation, STL-style set, map☆149Updated 5 years ago
- Library for Restartable Sequences☆73Updated last month