jonatanlinden / PRLinks
A lock-free priority queue implementation
☆34Updated 6 years ago
Alternatives and similar repositories for PR
Users that are interested in PR are comparing it to the libraries listed below
Sorting:
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- ☆20Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- Library for lock-free locks☆78Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- ☆38Updated 4 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆57Updated last year
- Scalable Structural Index Constructor for JSON Analytics☆24Updated 7 months ago
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆55Updated 2 years ago
- Persistent memory allocator for data-centric analytics☆54Updated this week
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆31Updated 6 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- InstLatX64_Demo☆43Updated last week
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Quick and dirty TSC access for benchmarking☆31Updated 8 years ago
- Multi-platform topology-aware memory management library☆13Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- ☆53Updated last year
- C++20 Coroutines and io_uring☆51Updated 2 years ago
- Parallel Balanced Binary Tree Structures☆116Updated 2 months ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- CDSChecker: A Model Checker for C11 and C++11 Atomics☆29Updated 11 years ago
- JSONPath Streaming with Bit-Parallel Fast-Forwarding☆25Updated 7 months ago
- Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox☆24Updated 10 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆159Updated 3 years ago
- Concurrent trie-hash map library☆91Updated last year
- Recoverable lock-free allocator based on LRMalloc☆47Updated 4 years ago