rmind / libqsbrLinks
QSBR and EBR library
☆135Updated 6 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☆94Updated 2 years ago
- Cross-platform atomic operations and lock algorithm library☆99Updated 7 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- A simple, reference implementation of a B^e-tree☆163Updated 6 years ago
- A working project for High-concurrency B-tree source code in C☆251Updated 5 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Updated 7 years ago
- Our open source benchmarks and code samples☆193Updated 2 months ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- The world's first wait-free Software Transactional Memory☆174Updated 5 years ago
- A benchmark framework for concurrent queue implementations☆296Updated 5 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- LSM-trie☆114Updated 4 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- COW b-trees☆108Updated 8 years ago
- Implementing coroutines, channels, message passing, etc.☆133Updated 4 years ago
- Read- and latency-optimized log structured merge tree☆175Updated 13 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- The Cicada engine☆59Updated 8 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆138Updated 6 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆96Updated 6 years ago
- Library for Restartable Sequences☆74Updated 2 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Core aware thread management system☆239Updated 2 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago