Rimuru: Unified Memory Management for Modern LLM Serving via Elastic Expert Offloading
Zhiyuan Fang, Dingyang Li, Jianfeng Zhong, Bin Wang, Weixi Zhu, Cunshu Ni, Zicong Hong, Wuhui Chen, Zibin Zheng
Abstract
Modern LLMs strain device memory through large model weights and attention states, particularly in resource-constrained scenarios. Existing systems separately provision memory for model weights and attention states, imposing fixed fixed boundaries that cannot adapt to the changing memory demands of workloads. Under heavy workloads, insufficient state capacity limits request concurrency and reduces throughput; under light workloads, idle memory in one region cannot be reallocated to another, wasting device memory. Meanwhile, modern LLM architectures introduce heterogeneous tensors with diverse layouts and lifetimes, further complicating memory management. These problems motivate unified memory management for heterogeneous tensors. However, a shared pool alone does not make memory directly reusable across tensors with different allocation granularities and execution layouts. This paper presents Rimuru, a modern LLM serving system that unifies memory management through elastic expert offloading. Rimuru establishes a shared page pool to enables elastic memory sharing across heterogeneous tensors. To accommodate different allocation granularities, Rimuru introduces memory views that allow each tensor type to interpret the shared memory space using its own page size and page table. Furthermore, Rimuru combines huge-page alignment with a multi-level page allocator that splits and merges pages, enabling cross-type capacity reuse. A page-table-aware fused MoE kernel directly accesses non-contiguous expert weights, avoiding copy overhead. Building on these mechanisms, Rimuru employs a workload-aware adjuster that dynamically reallocates pages across tensor types according to runtime demands. Implemented on top of vLLM, Rimuru remains compatible with modern LLMs. Evaluations show that Rimuru achieves up to 19.03x baseline throughput and reduces TTFT by 98.1% on average.
Create a lesson
Related papers
UMLoad: Fast On-Demand Model Loading on Unified Memory Architecture
Zimeng Wang, Jinrong Yang, Rong Chen
High-Throughput Private Information Retrieval with on-CPU Accelerators
Gyuyeong Kim
RTP-LLM: Building an Evolvable and Reliable LLM Inference Engine at Alibaba Scale
Jiarui Guo, Zhi Zhang, Boyu Tan et al.
Beyond Source Compatibility: WebAssembly as a Stable ABI for ARINC 653 Applications
Wanja Zaeske, Patrick Siegl, Florian Hartung et al.
USB Differentiated Service for Networked Cyber-Physical Systems
Anton Njavro, Rafiuddin Syed, Shriram Raja et al.
Callosal: Rethinking the Kernel Page Cache for Disaggregated Storage and Memory
James McMahon, Amit Samanta, Seung-seob Lee et al.