jonatanlinden / PRLinks
A lock-free priority queue implementation
☆35Updated 7 years ago
Alternatives and similar repositories for PR
Users that are interested in PR are comparing it to the libraries listed below
Sorting:
- Library for lock-free locks☆83Updated 2 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated last year
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆131Updated 7 months ago
- QSBR and EBR library☆130Updated 5 years ago
- ☆20Updated 2 years ago
- Parallel Balanced Binary Tree Structures☆120Updated 7 months ago
- ☆54Updated last year
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 3 years ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆79Updated 4 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated last week
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- A fast in-memory key-value store☆51Updated 8 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- User-space Page Management☆108Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- Fast Approximate Membership Filters (C++)☆286Updated 2 months ago
- A community-oriented list of useful NUMA-related libraries, tools, and other resources☆77Updated 5 years ago
- ☆44Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆116Updated 10 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- a high performance cache simulator and library☆110Updated last year
- A wall-clock stack-sampling profiler that actually works☆65Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago