jonatanlinden / PR
A lock-free priority queue implementation
☆29Updated 6 years ago
Related projects: ⓘ
- Library for lock-free locks☆72Updated last year
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆22Updated 7 months ago
- ☆20Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆52Updated 9 months ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆67Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Self-Tuning Adaptive Radix Tree☆26Updated 4 years ago
- CDSChecker: A Model Checker for C11 and C++11 Atomics☆25Updated 11 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆15Updated 3 years ago
- Adaptive Radix Tree in C++☆36Updated last week
- ☆50Updated 4 months ago
- ☆36Updated 4 years ago
- ☆36Updated 5 months ago
- ☆43Updated 3 years ago
- Testing memory-level parallelism☆64Updated 6 months ago
- ☆26Updated 3 years ago
- Concurrent trie-hash map library☆88Updated 10 months ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆108Updated 4 months ago
- A C11 implementation of D. Vyukov MPSC queue☆25Updated last year
- Task-based framework for automatic synchronization and memory prefetching.☆17Updated 2 years ago
- ☆56Updated 5 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆26Updated 3 years ago
- C++20 Coroutines and io_uring☆45Updated last year
- An open-source BzTree implementation☆90Updated 3 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆41Updated 11 years ago
- AVX512F and AVX2 versions of quick sort☆102Updated 6 years ago
- NUMA-Aware Reader-Writer Locks☆18Updated 10 years ago
- Benchmarking In-Memory Index Structures☆26Updated 5 years ago
- Tool for testing programs with C/C++11 Atomics☆10Updated 4 years ago
- ☆32Updated 2 months ago