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

Wei Da, Evangelia Kalyvianaki
8/5/2025
cs.DCcs.AI

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{da2025block,
  title  = {Block: Balancing Load in LLM Serving with Context, Knowledge and Predictive Scheduling},
  author = {Wei Da and Evangelia Kalyvianaki},
  year   = {2025},
  eprint = {2508.03611},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.03611v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.03611.svg)](https://codeofpaper.com/paper/2508.03611)

Discussion