REVIEW 1 cited by
Block: Balancing Load in LLM Serving with Context, Knowledge and Predictive Scheduling
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
Block: Balancing Load in LLM Serving with Context, Knowledge and Predictive Scheduling
read the original abstract
This paper presents Block, a distributed scheduling framework designed to optimize load balancing and auto-provisioning across instances in large language model serving frameworks by leveraging contextual information from incoming requests. Unlike popular model serving systems that rely on monolithic and heuristic task schedulers, Block operates as a fully distributed, stateless, and predictive scheduling system to achieve low overhead, reliability, and scalability. It leverages the deterministic and predictable characteristics of LLM inferences, such as host configurations, response lengths, and hardware performance, to make scheduling decisions based on accurately predicted metrics. Evaluation on a 12 GPUs cluster shows that Block significantly outperforms heuristic schedulers, boosting serving capacity by up to 16.7\% and reducing P99 tail latency by up to 49.5\%. These performance gains remain consistent across diverse models, workloads and configurations. Code and data are open-sourced.
Forward citations
Cited by 1 Pith paper
-
Beyond Accuracy and Cost: Latency-Aware LLM Query Routing for Dynamic Workloads
A serving-framework simulation that predicts time-to-first-token lets LLM routers jointly optimize accuracy, cost, and latency, improving accuracy-cost utility by up to 40% at matched latency.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.