Pith. sign in

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

arxiv 2508.03611 v2 pith:LK4QI5M7 submitted 2025-08-05 cs.DC cs.AI

Block: Balancing Load in LLM Serving with Context, Knowledge and Predictive Scheduling

classification cs.DC cs.AI
keywords blockschedulingservingacrossbalancingconfigurationsdistributedheuristic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Beyond Accuracy and Cost: Latency-Aware LLM Query Routing for Dynamic Workloads

    cs.AI 2026-05 conditional novelty 6.0

    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.