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:
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- Library for lock-free locks☆84Updated 2 years ago
- QSBR and EBR library☆135Updated 6 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆138Updated last month
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 4 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- A community-oriented list of useful NUMA-related libraries, tools, and other resources☆76Updated 5 years ago
- A fast in-memory key-value store☆52Updated 8 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- Persistent memory allocator for data-centric analytics☆60Updated 3 months ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆118Updated last year
- Parallel Balanced Binary Tree Structures☆122Updated 10 months ago
- Concurrent trie-hash map library☆94Updated 2 years ago
- ☆20Updated 3 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- A wall-clock stack-sampling profiler that actually works☆66Updated last year
- Lock-free allocator as described by Maged M. Michael, 2004☆48Updated 12 years ago
- EDSL for C++ to make just-in-time code generation easier☆88Updated 2 years ago
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- User-space Page Management☆111Updated last year
- Testing memory-level parallelism☆82Updated last year
- Montage is a system for building fast buffered persistent data structures on nonvolatile memory.☆16Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆289Updated 5 months ago
- The Berkeley Container Library☆126Updated last month
- Adaptive Radix Tree in C++☆50Updated this week
- A simple, reference implementation of a B^e-tree☆163Updated 6 years ago
- Benchmarks for our memory allocator☆70Updated 2 years ago