Skip to content
#small language model Open access

Hot–Cold Tiering of HBM and High Bandwidth Flash for Agentic LLM Serving

Jul 2026 · IEEE computer architecture letters · Vol 25, pp. 355-358 · 0 citations · 25 references
Computer Science

TL;DR

This work places the hot set in HBM and the cold pool in HBF, forming a hot-cold KV hierarchy within the GPU memory tier, while flash-establishing HBF as a cold-tier complement to HBM rather than its replacement.

Abstract

Large language model (LLM) serving is increasingly agentic, with multi-turn sessions that idle between actions yet must retain their full context. Limited GPU memory capacity forces inactive KV states to be evicted, so resuming a session incurs either costly recomputation or slow interconnect transfers. To address this, high bandwidth flash (HBF)—an on-package 3D-NAND memory offering orders-of-magnitude greater capacity than high bandwidth memory (HBM) at comparable read bandwidth—has emerged as a strong candidate. However, its high read energy and limited write endurance make it impractical to serve <italic>all</italic> KV traffic. Fortunately, our analysis shows that agentic KV states exhibit distinct access patterns: a small hot set is read for every decoding step, while a large cold pool is read only when a paused session resumes. Exploiting this, we place the hot set in HBM and the cold pool in HBF, forming a hot–cold KV hierarchy within the GPU memory tier. On agentic workloads with Qwen3-Coder-30B-A3B, our design delivers 14 ms time-between-tokens (TBT) and adds only <inline-formula><tex-math notation="LaTeX">$\approx \!0.1$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>≈</mml:mo><mml:mspace width="-0.166667em"/><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href="kim-ieq1-3729099.gif"/></alternatives></inline-formula> ms of resume latency on top of prefill, while hosting <inline-formula><tex-math notation="LaTeX">$24\times$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>24</mml:mn><mml:mo>×</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="kim-ieq2-3729099.gif"/></alternatives></inline-formula> more concurrent sessions per GPU. By confining HBM to the hot set, our design also cuts read power by 7.6 kW per 8-GPU node relative to serving all KV from flash—establishing HBF as a cold-tier complement to HBM rather than its replacement.

Read PDF

Similar papers

#machine learning Preprint Sep 2026

Characterizing High Bandwidth Flash for LLM Serving

Large language model (LLM) serving requires substantial memory to store model weights and KV caches. As models grow larger and contexts become longer, memory capacity and bandwidth increasingly become bottlenecks for serving performance. Agentic workloads compound this pressure through repeated interactions over growin...

Zack Yu, Chloe Wong, C. Hooper et al. · 0 citations
Preprint Aug 2026

HBF Sucks? A Full-Stack Characterization of High-Bandwidth Flash for KV-Centric LLM Serving

A faster storage device should make serving faster. We find the opposite. High-Bandwidth Flash (HBF) stacks NAND behind a wide, package-local interface, promising flash-scale capacity with far lower read latency and higher bandwidth than an SSD. The obvious move is to keep an SSD-style Mooncake KV-offloading stack and...

Zhuo-Ran Li, Zhuo-Hang Bian, Xin Huang et al. · 5 citations
Preprint Sep 2026

Dynamic HBM Repartitioning for Multi-Turn MoE Serving

Long-running multi-turn requests accumulate reusable key-value (KV) state. Once this state exceeds a fixed GPU KV-cache allocation, serving systems evict reusable prefixes, repeat prefill work, and may preempt requests. This pressure is particularly acute for Mixture-of-Experts (MoE) models: their expert weights occupy...

Jinpyo Kim, Mingi Kwon, Younghoon Min et al. · 0 citations
Preprint Aug 2026

OasisKV: Scaling In-Decode KV Cache Beyond HBM with Lookahead Sparse Prefetching

OasisKV is presented, a memory-centric LLM inference system design that alleviates HBM capacity pressure by decoupling full KV-cache storage from HBM during LLM decoding and observes that future important tokens can be predicted accurately in advance using lookahead tokens drafted by speculative decoding (SD).

Can Xiao, Sukmin Cho, J. We et al. · 0 citations
Preprint Sep 2026

UNISON: A Co-Designed Near-Memory Scheduler of Session KV Residency for LLM Agents

Large language models are increasingly composed into agent loops that plan, call tools, and resume the same task after each action. These loops press a shared memory hierarchy harder than conventional multi-turn chat, because they hold a growing key-value (KV) prefix across tool waits and place many sessions on one SRA...

Fan He, Yan Li, Xiao-Yang Zeng · 0 citations
Preprint Sep 2026

Trillion-Parameter MoE in a Box: Decoupling Memory Provisioning with High-Bandwidth Flash

An MoE appliance for trillion-parameter models at low concurrency must host terabytes of weights on one node and serve prefill and decode with fixed resources. Combining operator analysis of two trillion-parameter MoE models, a measured expert routing trace, and agentic serving traces over multiple turns, we explore a...

Peng-Fei Xia, Tuo Hao, Sheng-Wei Li et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.