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☆82Updated 2 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆128Updated 4 months ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆77Updated 4 years ago
- ☆20Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- User-space Page Management☆109Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- Fast Approximate Membership Filters (C++)☆281Updated 7 months ago
- Self-Tuning Adaptive Radix Tree☆28Updated 5 years ago
- QSBR and EBR library☆121Updated 5 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- Benchmarking suite for Google workloads☆127Updated last week
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- ☆48Updated last year
- Parallel Balanced Binary Tree Structures☆117Updated 4 months ago
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- ☆54Updated last year
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- ☆127Updated 2 years ago
- This is a mirror of the official libpfm4 git repository, https://sourceforge.net/p/perfmon2/libpfm4/ci/master/tree/ with some local branc…☆65Updated 9 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- A community-oriented list of useful NUMA-related libraries, tools, and other resources☆71Updated 4 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated 5 years ago
- ☆15Updated 5 years ago
- Montage is a system for building fast buffered persistent data structures on nonvolatile memory.☆15Updated 3 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- ☆108Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago