wichtounet / btrees
C++ implementation of concurrent Binary Search Trees
☆72Updated 9 years ago
Alternatives and similar repositories for btrees:
Users that are interested in btrees are comparing it to the libraries listed below
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆73Updated 10 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 10 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆212Updated last year
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 7 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆178Updated 7 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆30Updated 6 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- Trie is a lightweight and simple autocompletion data structure written in C++11.☆44Updated 9 years ago
- QSBR and EBR library☆117Updated 5 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆51Updated last year
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆74Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 years ago
- Boost.Sort☆52Updated 2 months ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- Component-Model Framework in C++☆44Updated 9 years ago
- Benchmark of common hash functions☆35Updated 5 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆55Updated last year
- ☆66Updated 4 years ago
- A benchmark of some prominent C/C++ hash table implementations☆103Updated 5 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆35Updated 9 years ago
- Effective Memory Reclamation☆54Updated 5 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆14Updated 9 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- The world's first Web-scale memory allocator☆106Updated 6 years ago