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
  ☆76Updated last year
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆39Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆23Updated 11 months ago
• L-v-M / async
  ☆20Updated 2 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆54Updated 2 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 8 months ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆39Updated this week
• lemire / testingmlp
  Testing memory-level parallelism
  ☆67Updated 10 months ago
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆41Updated this week
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• DBOS-project / dbos-scheduler
  ☆26Updated 3 years ago
• urcs-sync / Montage
  Montage is a system for building fast buffered persistent data structures on nonvolatile memory.
  ☆15Updated 2 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• tuhhosg / exmap
  ☆39Updated 9 months ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆71Updated 4 years ago
• LLNL / umap
  User-space Page Management
  ☆106Updated 5 months ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 7 months ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆29Updated 5 years ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆43Updated 11 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• eelejalde / rw-numa-locks
  NUMA-Aware Reader-Writer Locks
  ☆18Updated 10 years ago
• wcohen / libpfm4
  This is a mirror of the official libpfm4 git repository, https://sourceforge.net/p/perfmon2/libpfm4/ci/master/tree/ with some local branc…
  ☆56Updated 2 months ago
• UWQuickstep / quickstep
  Quickstep project
  ☆41Updated 2 months ago