REVIEW 3 cited by
NEO: Saving GPU Memory Crisis with CPU Offloading for Online LLM Inference
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Online LLM inference powers many exciting applications such as intelligent chatbots and autonomous agents. Modern LLM inference engines widely rely on request batching to improve inference throughput, aiming to make it cost-efficient when running on expensive GPU accelerators. However, the limited GPU memory has largely limited the batch size achieved in practice, leaving significant GPU compute resources wasted. We present NEO, an online LLM inference system that offloads part of attention compute and KV cache states from the GPU to the local host CPU, effectively increasing the GPU batch size and thus inference throughput. To this end, NEO proposes asymmetric GPU-CPU pipelining and load-aware scheduling to balance GPU and CPU loads and fully utilize their compute and memory resources. We evaluate NEO on a wide range of workloads (i.e., code generation, text summarization), GPUs (i.e., T4, A10G, H100), and LLM models (i.e., 7B, 8B, 70B). NEO achieves up to 7.5$\times$, 26%, and 14% higher throughput compared to GPU-only approach on T4, A10G, and H100 GPUs, respectively, while maintaining the same latency; with more powerful CPUs, NEO achieves up to 79.3% throughput gain on A10G GPU.
Forward citations
Cited by 3 Pith papers
-
MLP-Offload: Multi-Level, Multi-Path Offloading for LLM Pre-training to Break the GPU Memory Wall
MLP-Offload accelerates LLM pre-training on memory-constrained GPUs by mixing local NVMe and remote PFS offloading with cache-aware subgroup reordering, achieving up to 2.5x faster iterations than DeepSpeed ZeRO-3.
-
Learn from the Past: Fast Sparse Indexing for Large Language Model Decoding
LFPS predicts which KV cache positions a decoder will attend to by reusing historical vertical and slash patterns plus local expansion, then runs exact Top-k only on the predicted candidate set.
-
HCAttention: Extreme KV Cache Compression via Heterogeneous Attention Computing for LLMs
HCAttention combines key quantization, CPU value offloading, and cumulative-attention eviction to run long-context LLMs with 12.5% to 25% of the GPU KV cache while keeping LongBench accuracy close to full attention.
Discussion (0). Sign in to comment.