n3ko1 / ConcurrentSkipList
generic, lock-free, concurrent skip list implementation
☆8Updated last year
Related projects ⓘ
Alternatives and complementary repositories for ConcurrentSkipList
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 7 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆73Updated 3 years ago
- ☆15Updated 7 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆214Updated last year
- W-TinyLFU cache C++11 header only implementation☆55Updated 6 years ago
- based on the work of Harald Lang when at CWI☆22Updated 4 years ago
- ☆43Updated 3 years ago
- pmwcas☆135Updated last year
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆35Updated last week
- The world's first wait-free Software Transactional Memory☆169Updated 4 years ago
- C++ implementation of concurrent Binary Search Trees☆73Updated 9 years ago
- An adaptive radix tree for efficient indexing in main memory.☆150Updated 8 months ago
- LSM-trie☆114Updated 3 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆149Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- NVM Evaluation Testbed☆28Updated 6 years ago
- Benchmark of common hash functions☆35Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- A transactional main-memory database system on multicores☆102Updated 6 years ago
- Buffer based LRU cache☆36Updated last year
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- ☆115Updated 2 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆29Updated 6 years ago
- ☆21Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- A C++ library for integer array compression☆27Updated 2 years ago