Pith. sign in

REVIEW 2 cited by

Learned Best-Effort LLM Serving

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 2401.07886 v2 pith:J56YPSBA submitted 2024-01-15 cs.LG cs.AIcs.CLcs.DC

classification cs.LGcs.AIcs.CLcs.DC
keywords servingbest-effortlearnedoftensystemabovedistributionpeak
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Many applications must provide low-latency LLM service to users or risk unacceptable user experience. However, over-provisioning resources to serve fluctuating request patterns is often prohibitively expensive. In this work, we present a best-effort serving system that employs deep reinforcement learning to adjust service quality based on the task distribution and system load. Our best-effort system can maintain availability with over 10x higher client request rates, serves above 96% of peak performance 4.1x more often, and serves above 98% of peak performance 2.3x more often than static serving on unpredictable workloads. Our learned router is robust to shifts in both the arrival and task distribution. Compared to static serving, learned best-effort serving allows for cost-efficient serving through increased hardware utility. Additionally, we argue that learned best-effort LLM serving is applicable in wide variety of settings and provides application developers great flexibility to meet their specific needs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Cascade: Exploiting SLO-Aware latency budget for fair and high goodput LLM inference serving

    cs.DC 2026-08 conditional novelty 6.0 of 10

    Cascade coordinates request scheduling and multi-tier KV-cache movement through a single per-request latency budget, improving SLO-satisfied goodput by up to 2.4x in simulation.

  2. Adaptive Request Scheduling for CodeLLM Serving with SLA Guarantees

    cs.SE 2025-06 conditional novelty 4.0 of 10

    SABER uses a fitted scalability curve and deadline-aware admission control to dynamically size continuous batches, improving SLA-compliant throughput by up to 26% over the best static configuration.

Pith tools