English
Related papers

Related papers: O^3-LSM: Maximizing Disaggregated LSM Write Perfor…

200 papers

Log-Structured Merge (LSM) Trees provide a tiered data storage and retrieval paradigm that is attractive for write-optimized data systems. Maintaining an efficient buffer in memory and deferring updates past their initial write-time, the…

Databases · Computer Science 2018-09-11 Aron Szanto

Although an increasing number of databases now embrace shared-storage architectures, current storage-disaggregated systems have yet to strike an optimal balance between cost and performance. In high-concurrency read/write scenarios,…

Databases · Computer Science 2026-03-02 Quanqing Xu , Mingqiang Zhuang , Chuanhui Yang , Quanwei Wan , Fusheng Han , Fanyu Kong , Hao Liu , Hu Xu , Junyu Ye

Serving long-context LLMs is challenging because request lengths and batch composition vary during token generation, causing the memory footprint to fluctuate significantly at runtime. Offloading KV caches to host memory limits effective…

Artificial Intelligence · Computer Science 2026-03-03 Xinyue Ma , Heelim Hong , Taegeon Um , Jongseop Lee , Seoyeong Choy , Woo-Yeon Lee , Myeongjae Jeon

Modern data-intensive applications increasingly store and process big-value items, such as multimedia objects and machine learning embeddings, which exacerbate storage inefficiencies in Log-Structured Merge-Tree (LSM)-based key-value…

Databases · Computer Science 2025-06-10 Ming Li , Wendi Cheng , Jiahe Wei , Xueqiang Shan , Weikai Liu , Xiaonan Zhao , Xiao Zhang

Log-Structured Merge tree (LSM tree) Key-Value (KV) stores have become a foundational layer in the storage stacks of datacenter and cloud services. Current approaches for achieving reliability and availability avoid replication at the KV…

Databases · Computer Science 2021-10-20 Michalis Vardoulakis , Giorgos Saloustros , Pilar González-Férez , Angelos Bilas

Large language models (LLMs) are increasingly deployed in AI infrastructure, driving the need for high throughput, resource efficient serving systems. Disaggregated LLM serving, which separates prompt prefill from auto-regressive decode,…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-11 Yiyuan He , Minxian Xu , Jingfeng Wu , Jianmin Hu , Chong Ma , Min Shen , Le Chen , Chengzhong Xu , Lin Qu , Kejiang Ye

We present Keigo, a concurrency- and workload-aware storage middleware that enhances the performance of log-structured merge key-value stores (LSM KVS) when they are deployed on a hierarchy of storage devices. The key observation behind…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-06-18 Rúben Adão , Zhongjie Wu , Changjun Zhou , Oana Balmau , João Paulo , Ricardo Macedo

Different from traditional Large Language Model (LLM) serving that colocates the prefill and decode stages on the same GPU, disaggregated serving dedicates distinct GPUs to prefill and decode workload. Once the prefill GPU completes its…

Performance · Computer Science 2026-01-15 Jiaxi Li , Yue Zhu , Eun Kyung Lee , Klara Nahrstedt

The cloud infrastructure motivates disaggregation of monolithic data stores into components that are assembled together based on an application's workload. This study investigates disaggregation of an LSM-tree key-value store into…

Databases · Computer Science 2021-05-04 Haoyu Huang , Shahram Ghandeharizadeh

Log-Structured Merge-trees (LSM-trees) have been widely used in modern NoSQL systems. Due to their out-of-place update design, LSM-trees have introduced memory walls among the memory components of multiple LSM-trees and between the write…

Databases · Computer Science 2020-07-16 Chen Luo , Michael J. Carey

Modern mainstream persistent key-value storage engines utilize Log-Structured Merge tree (LSM-tree) based designs, optimizing read/write performance by leveraging sequential disk I/O. However, the advent of SSDs, with their significant…

Databases · Computer Science 2024-06-27 Jin Jiang , Dongsheng He , Yu Hu , Dong Liu , Chenfan Xiao , Hongxiao Bi , Yusong Zhang , Chaoqu Jiang , Zhijun Fu

Modern key-value storage engines built on Log-Structured Merge-trees (LSM-trees), such as RocksDB and LevelDB, rely heavily on the performance of their compaction operations, which are impacted by a complex set of interdependent…

Performance · Computer Science 2026-02-16 Jiabiao Ding , Yina Lv , Qiao Li , Zhirong Shen , Chun Jason Xue

Existing large language model (LLM) serving systems fall into two categories: 1) a unified system where prefill phase and decode phase are co-located on the same GPU, sharing the unified computational resource and storage, and 2) a…

Computation and Language · Computer Science 2025-04-29 Ke Hong , Lufang Chen , Zhong Wang , Xiuhong Li , Qiuli Mao , Jianping Ma , Chao Xiong , Guanyu Wu , Buhe Han , Guohao Dai , Yun Liang , Yu Wang

Training LLMs larger than the aggregated memory of multiple GPUs is increasingly necessary due to the faster growth of LLM sizes compared to GPU memory. To this end, multi-tier host memory or disk offloading techniques are proposed by state…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-03 Avinash Maurya , M. Mustafa Rafique , Franck Cappello , Bogdan Nicolae

Log-Structured Merge-tree-based Key-Value Store (LSM-KVS) is a foundational storage engine serving diverse modern workloads, systems, and applications. To suit varying use cases, LSM-KVS allows a vast configuration space that controls core…

Large Language Models (LLMs) increasingly require processing long text sequences, but GPU memory limitations force difficult trade-offs between memory capacity and bandwidth. While HBM-based acceleration offers high bandwidth, its capacity…

Hardware Architecture · Computer Science 2025-04-25 Qingyuan Liu , Liyan Chen , Yanning Yang , Haocheng Wang , Dong Du , Zhigang Mao , Naifeng Jing , Yubin Xia , Haibo Chen

Disaggregated LLM serving improves resource efficiency by separating the compute-intensive prefill phase from the latency-critical decode phase. However, this architecture introduces a fundamental bottleneck: key/value (KV) tensors…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-12-23 Dongha Yoon , Younghoon Min , Hoshik Kim , Sam H. Noh , Jongryool Kim

Memory disaggregation is an emerging data center architecture that improves resource utilization and scalability. Replication is key to ensure the fault tolerance of applications, but replicating shared data in disaggregated memory is hard.…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-09-25 Antoine Murat , Clément Burgelin , Athanasios Xygkis , Igor Zablotchi , Marcos K. Aguilera , Rachid Guerraoui

On-device recommendation is critical for a number of real-world applications, especially in scenarios that have agreements on execution latency, user privacy, and robust functionality when internet connectivity is unstable or even…

Information Retrieval · Computer Science 2026-01-15 Xin Xia , Hongzhi Yin , Shane Culpepper

We present~\emph{KV-Tandem}, a modular architecture for building LSM-based storage engines on top of simple, non-ordered persistent key-value stores (KVSs). KV-Tandem enables advanced functionalities such as range queries and snapshot…