Alternatives and similar repositories for libCacheSim:

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

• viktorleis / mmapbench
  ☆136Updated 2 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆158Updated 3 years ago
• 1a1a11a / libCacheSim
  a high performance library for building cache simulators
  ☆212Updated last week
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 11 months ago
• tuhhosg / exmap
  ☆45Updated last year
• Thesys-lab / Segcache
  ☆117Updated last year
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆55Updated 6 months ago
• Thesys-lab / sosp23-s3fifo
  The repo for SOSP23 paper: FIFO queues are all you need for cache evictions
  ☆119Updated 10 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆148Updated 7 years ago
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆121Updated 6 months ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆122Updated 4 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 5 months ago
• cacheMon / NSDI24-SIEVE
  The repo for NSDI24 paper: SIEVE is Simpler than LRU: an Efficient Turn-Key Eviction Algorithm for Web Caches
  ☆60Updated 8 months ago
• viktorleis / vmcache
  ☆66Updated 3 weeks ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆99Updated 2 years ago
• Thesys-lab / HotOS23-QD-LP
  The repo for HotOS paper "FIFO can be Better than LRU: the Power of Lazy Promotion and Quick Demotion"
  ☆33Updated last year
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆79Updated 2 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• westerndigitalcorporation / libzbd
  Zoned block device manipulation library and tools
  ☆71Updated 10 months ago
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• flode / ARTSynchronized
  ☆116Updated 3 years ago
• LLNL / umap
  User-space Page Management
  ☆107Updated 8 months ago
• microsoft / pmwcas
  pmwcas
  ☆136Updated 2 years ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago