cacheMon / libCacheSimLinks
a high performance cache simulator and library
☆110Updated last year
Alternatives and similar repositories for libCacheSim
Users that are interested in libCacheSim are comparing it to the libraries listed below
Sorting:
- ☆144Updated 3 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 4 years ago
- ☆121Updated 2 years ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆125Updated last year
- ☆74Updated 2 months ago
- ☆48Updated last year
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- The repo for SOSP23 paper: FIFO queues are all you need for cache evictions☆129Updated last year
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- a high performance library for building cache simulators☆267Updated this week
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- A simple, reference implementation of a B^e-tree☆158Updated 6 years ago
- Order-preserving key encoder☆126Updated 5 years ago
- Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"☆25Updated last year
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆107Updated 2 months ago
- Adaptive Radix Tree in C++☆47Updated this week
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆68Updated 2 months ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆48Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆26Updated last year
- ☆55Updated last year
- The repo for HotOS paper "FIFO can be Better than LRU: the Power of Lazy Promotion and Quick Demotion"☆34Updated 2 years ago
- LazyLog: A New Shared Log Abstraction for Low-Latency Applications☆42Updated 6 months ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- The repo for NSDI24 paper: SIEVE is Simpler than LRU: an Efficient Turn-Key Eviction Algorithm for Web Caches☆73Updated last year
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 6 months ago
- AnyBlob - A Universal Cloud Object Storage Download Manager Built For Cost-Throughput Optimal Analytics!☆139Updated last month