LGApr 1

Scheduling LLM Inference with Uncertainty-Aware Output Length Predictions

arXiv:2604.0049988.92 citationsh-index: 2
AI Analysis

This work improves scheduling efficiency for LLM inference systems, benefiting users and providers by reducing latency and increasing throughput, though it is incremental as it builds on existing shortest job first principles with a novel uncertainty-aware adjustment.

The paper tackles the problem of scheduling LLM inference by addressing the uncertainty in output length predictions, proposing a Tail Inflated Expectation (TIE) metric based on a log-t distribution to replace point estimates in shortest job first scheduling. The results show that TIE reduces per-token latency by 2.31× for online inference and improves throughput by 1.42× for offline data generation compared to baselines.

To schedule LLM inference, the \textit{shortest job first} (SJF) principle is favorable by prioritizing requests with short output lengths to avoid head-of-line (HOL) blocking. Existing methods usually predict a single output length for each request to facilitate scheduling. We argue that such a \textit{point estimate} does not match the \textit{stochastic} decoding process of LLM inference, where output length is \textit{uncertain} by nature and determined by when the end-of-sequence (EOS) token is sampled. Hence, the output length of each request should be fitted with a distribution rather than a single value. With an in-depth analysis of empirical data and the stochastic decoding process, we observe that output length follows a heavy-tailed distribution and can be fitted with the log-t distribution. On this basis, we propose a simple metric called Tail Inflated Expectation (TIE) to replace the output length in SJF scheduling, which adjusts the expectation of a log-t distribution with its tail probabilities to account for the risk that a request generates long outputs. To evaluate our TIE scheduler, we compare it with three strong baselines, and the results show that TIE reduces the per-token latency by $2.31\times$ for online inference and improves throughput by $1.42\times$ for offline data generation.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes