Alternatives and similar repositories for pm

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

• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 years ago
• mfleming / performance-resources
  A collection of software performance content, blogs, books, and lists.
  ☆120Updated last year
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆82Updated last year
• LLNL / umap
  User-space Page Management
  ☆108Updated last year
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆165Updated 4 years ago
• dendibakh / dendibakh.github.io
  Blog and pages generated by Jekyll. Hosted on GitHub.
  ☆57Updated last week
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆286Updated last month
• google / hashtable-benchmarks
  ☆109Updated last year
• westerndigitalcorporation / hmmap
  Heterogeneous memory mapper (hmmap)
  ☆11Updated 4 years ago
• mejbah / SyncPerf
  A lightweight profiler to detect and categorize root causes of synchronization related performance issues in multithreaded programs
  ☆21Updated 8 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆180Updated 7 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• google / fleetbench
  Benchmarking suite for Google workloads
  ☆130Updated last week
• ydmao / Metis
  MapReduce for multi-core
  ☆49Updated 12 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 15 years ago
• compudj / librseq
  Library for Restartable Sequences
  ☆73Updated last month
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆79Updated 3 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 3 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆125Updated 5 years ago
• RN-dev-repo / GAPP
  Generic Automatic Parallel Profiler
  ☆35Updated 5 years ago
• shuveb / loti-examples
  Source code for example programs from Lord of the io_uring guide
  ☆192Updated last year
• rmind / libqsbr
  QSBR and EBR library
  ☆127Updated 5 years ago
• Thesys-lab / Segcache
  ☆121Updated 2 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆41Updated last year
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆109Updated last year