Alternatives and similar repositories for PR

Users that are interested in PR are comparing it to the libraries listed below

• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆121Updated 8 months ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆135Updated 8 months ago
• LLNL / umap
  User-space Page Management
  ☆111Updated last year
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated last year
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆287Updated 2 months ago
• rmind / libqsbr
  QSBR and EBR library
  ☆133Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆136Updated last month
• efficient / mica2
  A fast in-memory key-value store
  ☆51Updated 8 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 3 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆166Updated last year
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆31Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆55Updated last year
• AutomataLab / Pison
  Scalable Structural Index Constructor for JSON Analytics
  ☆25Updated last year
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆158Updated 6 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆47Updated last week
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆112Updated last year
• google / fleetbench
  Benchmarking suite for Google workloads
  ☆133Updated last week
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 15 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆79Updated 4 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆43Updated last year
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago