S$^{3}$: Increasing GPU Utilization during Generative Inference for Higher Throughput
Yunho Jin, Chun-Feng Wu, David Brooks, Gu-Yeon Wei
TL;DR
This work tackles the memory-bound nature of generative LLM inference caused by the growing KV cache, which constrains batch size and GPU throughput. It introduces S3, a system comprising an output-length predictor, a length-aware scheduler, and a supervisor that handles mispredictions, to allocate memory precisely and batch requests intelligently. Across multiple models and online/offline scenarios, S3 achieves up to 6.49x throughput improvements over worst-case baselines while maintaining latency SLOs, and can reduce required GPU counts for comparable throughput. The approach expands the latency-throughput trade-off frontier and offers practical cost benefits for deploying Transformer-based generative models at scale.
Abstract
Generating texts with a large language model (LLM) consumes massive amounts of memory. Apart from the already-large model parameters, the key/value (KV) cache that holds information about previous tokens in a sequence can grow to be even larger than the model itself. This problem is exacerbated in one of the current LLM serving frameworks which reserves the maximum sequence length of memory for the KV cache to guarantee generating a complete sequence as they do not know the output sequence length. This restricts us to use a smaller batch size leading to lower GPU utilization and above all, lower throughput. We argue that designing a system with a priori knowledge of the output sequence can mitigate this problem. To this end, we propose S$^{3}$, which predicts the output sequence length, schedules generation queries based on the prediction to increase device resource utilization and throughput, and handle mispredictions. Our proposed method achieves 6.49$\times$ throughput over those systems that assume the worst case for the output sequence length.
