LLM Request Scheduling
LLM: Large Language Model
Overview
LLM request scheduling decides which prompts to admit, batch, route, or pause so inference servers can serve requests efficiently under limited compute and memory. Common approaches include shortest-job-first and length-aware ordering, prompt-based length prediction, continuous batching, and policies that account for KV-cache use, prefill and decode stages, or service-level priorities. Newer methods also coordinate scheduling with cache retention, prefill/decode disaggregation, and online traffic estimates, with evaluations spanning chat, code, retrieval, and bursty workloads. A key tension is that predictions and policies that improve average latency or throughput can worsen tail latency, fairness, or stability, especially when workload lengths, hardware, and memory demands vary.
Latest papers
25 papers5 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.