Alternatives and similar repositories for ssd-vs-pm

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

• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆78Updated 3 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆37Updated 2 years ago
• cosmoss-jigu / pactree
  ☆30Updated 4 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆49Updated 2 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆119Updated 4 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆49Updated 4 years ago
• DICL / CCEH
  ☆99Updated 5 years ago
• iotlpf / ROLEX
  ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems
  ☆80Updated 2 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated last year
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆110Updated last year
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last year
• sfu-dis / pibench-ep2
  Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)
  ☆21Updated 3 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆36Updated 6 years ago
• WukLab / pDPM
  Passive Disaggregated Persistent Memory at USENIX ATC 2020.
  ☆51Updated 5 years ago
• NVSL / OptaneStudy
  ☆120Updated 4 years ago
• thustorage / nvm-datastructure
  ☆50Updated 5 years ago
• SJTU-IPADS / xstore
  Fast RDMA-based Ordered Key-Value Store using Remote Learned Cache
  ☆117Updated 5 years ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆48Updated 7 months ago
• thustorage / pacman
  Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory
  ☆43Updated 3 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆167Updated 4 years ago
• SJTU-IPADS / drtm
  Fast In-memory Transaction Processing using RDMA and HTM
  ☆59Updated 10 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆50Updated 4 years ago
• hpides / perma-bench
  A benchmarking suite to evaluate the performance of persistent memory access (PerMA-Bench @ VLDB '22)
  ☆20Updated 3 years ago
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆76Updated 5 years ago
• liumx10 / ICPP-RNTree
  ☆19Updated 6 years ago
• cosmoss-jigu / tips
  ☆15Updated 3 years ago
• sudarsunkannan / lsm_nvm
  NoveLSM
  ☆40Updated 7 years ago