Pith. sign in

REVIEW 4 cited by

SLO-Aware Scheduling for Large Language Model Inferences

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 2504.14966 v2 pith:RYKBNT2Y submitted 2025-04-21 cs.DC

classification cs.DC
keywords requestslosdistinctexperiencesframeworkinferencelanguagelarge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large language models (LLMs) have revolutionized applications such as code completion, chatbots, and online classification. To elevate user experiences, service level objectives (SLOs) serve as crucial benchmarks for assessing inference services capabilities. In practice, an inference service processes multiple types of tasks, each with its own distinct SLO. To ensure satisfactory user experiences, each request's distinct SLOs should be considered in scheduling. However, existing designs lack this consideration, leading to insufficient hardware utility and suboptimal performance. This paper analyzes scenarios to process tasks with varying SLOs, and introduces a simulated annealing-based scheduler to decide request priority sequence based on a request's SLO, input lengths, and possible output lengths. As the first specialized scheduler for multi-SLO scenarios, this work improves SLO attainment by up to 5x and reduces average latency by 31.6% on Python-Code-23k-ShareGPT and ShareGPT_Vicuna_unfiltered datasets, compared to current state-of-the-art framework vLLM and a new framework LMDeploy.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

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

    cs.AI 2026-05 conditional novelty 6.0 of 10

    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.

  2. MaaSO: SLO-aware Orchestration of Heterogeneous Model Instances for MaaS

    cs.DC 2025-09 conditional novelty 6.0 of 10

    MaaSO assigns different parallelism strategies and batch sizes to LLM instances and routes requests by deadline, improving simulated SLO attainment by 15 to 30 percent.

  3. Rethinking Caching for LLM Serving Systems: Beyond Traditional Heuristics

    cs.DB 2025-08 conditional novelty 6.0 of 10

    SISO caches representative centroid embeddings of similar queries and adjusts its similarity threshold under load, improving semantic cache hit ratios for LLM serving by up to 1.71x with a small accuracy cost.

  4. An Inquiry into Datacenter TCO for LLM Inference with FP8

    cs.LG 2025-02 conditional novelty 6.0 of 10

    Measured FP8 thin-GEMM throughput shows Intel Gaudi 2/3 outperform NVIDIA H100/H200 on LLM decode-style workloads, making workload-level benchmarks more decisive than peak TFLOPS for datacenter TCO.

Pith tools