Put an Elephant into a Fridge: Optimizing Cache Efficiency for In-memory Key-value Stores
Kefei Wang, Jian Liu, Feng Chen
Abstract
In today's data centers, memory-based key-value systems, such as Memcached and Redis, play an indispensable role in providing high-speed data services. The rapidly growing capacity and quickly falling price of DRAM memory in the past years have enabled us to create a large memory-based key-value store, which is able to serve hundreds of Gigabytes to even Terabytes of key-value data all in memory. Unfortunately, CPU cache in modern processors has not seen a similar growth in capacity, still remaining at the level of a few dozens of Megabytes. Such an extremely low cache-to-memory ratio (less than 0.1%) poses a significant new challenge---the limited CPU cache is becoming a severe performance bottleneck that hinders us from fully exploiting the great potential of high-speed memory-based key-value stores. To address this critical challenge, we propose a highly cache-efficient scheme, called Cavast, to optimize the cache utilization of large-capacity in-memory key-value stores. Our goal is to maximize cache efficiency and system performance without any hardware changes. We first present two light-weight, software-only mechanisms to enable user to indirectly control the cache content at application level. Then we propose a set of optimization policies to address several critical design issues that impair cache's efficacy in the current key-value store systems. By carefully reorganizing the data layout in memory, redesigning the hash indexing structure, and offloading garbage collection, we can effectively improve the utilization of the limited cache space. We have developed a module in Linux as a kernel-level support, and implemented two prototypes based on Memcached and Redis with the proposed Cavast scheme. Our experimental studies show promising results. On a 6-core Intel Xeon processor with only 15-MB cache, we can raise the cache hit ratio up to 82.7% with a very small cache-to-memory ratio (0.023%), and significantly increase the key-value system throughput by a factor of up to 4.2.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ac285726-19fe-40a3-8836-6db1f45dcfeaCited by top-tier papers6
- Cache-Craft: Managing Chunk-Caches for Efficient Retrieval-Augmented GenerationShubham Agarwal, Sai Sundaresan, Subrata Mitra, Debabrata Mahapatra et al.SIGMOD 2025 · 20 citations
- Rearchitecting In-Memory Object Stores for Low LatencyDanyang Zhuo, Kaiyuan Zhang, Zhuohan Li, Siyuan Zhuang et al.VLDB 2022 · 7 citations
- Catalyst: Optimizing Cache Management for Large In-memory Key-value SystemsKefei Wang, Feng ChenVLDB 2023 · 6 citations
- CHARM: Chiplet Heterogeneity-Aware Runtime Mapping SystemAlessandro Fogli, Bo Zhao, Peter R. Pietzuch, Jana GicevaEuroSys 2026 · 2 citations
- Efficient Cooperation-Aware Key and Value Management for LLM InferenceQiheng Sun, Hongwei Zhang, Junxu Liu, Haocheng Xia et al.VLDB 2026
Related papers
- BMC: Accelerating Memcached using Safe In-kernel Caching and Pre-stack ProcessingYoann Ghigoff, Julien Sopena, Kahina Lazri, Antoine Blin et al.NSDI 2021 · 79 citations
- Redesigning High-Performance LSM-based Key-Value Stores with Persistent CPU CachesYijie Zhong, Zhirong Shen, Zixiang Yu, Jiwu ShuICDE 2023 · 8 citations
- Range Cache: An Efficient Cache Component for Accelerating Range Queries on LSM - Based Key-Value StoresXiaoliang Wang, Peiquan Jin, Yongping Luo, Zhaole ChuICDE 2024 · 10 citations
- Dandelion: Smaller Clusters, Bigger Speeds - Distributed Transactions RedefinedAntonios Katsarakis, Vasilis Gavrielatos, Chris Jensen, Nikos NtarmosVLDB 2025
- AC-Cache: A Memory-Efficient Caching System for Small Objects via Exploiting Access CorrelationsFulin Nan, Ronglong Wu, Zhirong Shen, Jiahui Yang et al.PPoPP 2025 · 1 citation
