Pith

open record

sign in
Browse

arxiv: 2403.02310 · v3 · pith:GHGZHR4S · submitted 2024-03-04 · cs.LG · cs.DC

Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Serve

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:GHGZHR4Srecord.jsonopen to challenge →

classification cs.LG cs.DC
keywords sarathi-servelatencydecodeiterationsprefillservingbatchingcapacity
0
0 comments X
read the original abstract

Each LLM serving request goes through two phases. The first is prefill which processes the entire input prompt and produces the first output token and the second is decode which generates the rest of output tokens, one-at-a-time. Prefill iterations have high latency but saturate GPU compute due to parallel processing of the input prompt. In contrast, decode iterations have low latency but also low compute utilization because a decode iteration processes only a single token per request. This makes batching highly effective for decodes and consequently for overall throughput. However, batching multiple requests leads to an interleaving of prefill and decode iterations which makes it challenging to achieve both high throughput and low latency. We introduce an efficient LLM inference scheduler, Sarathi-Serve, to address this throughput-latency tradeoff. Sarathi-Serve introduces chunked-prefills which splits a prefill request into near equal sized chunks and creates stall-free schedules that adds new requests in a batch without pausing ongoing decodes. Stall-free scheduling unlocks the opportunity to improve throughput with large batch sizes while minimizing the effect of batching on latency. Furthermore, uniform batches in Sarathi-Serve ameliorate the imbalance between iterations resulting in minimal pipeline bubbles. Our techniques yield significant improvements in inference performance across models and hardware under tail latency constraints. For Mistral-7B on single A100 GPUs, we achieve 2.6x higher serving capacity and up to 3.7x higher serving capacity for the Yi-34B model on two A100 GPUs as compared to vLLM. When used with pipeline parallelism on Falcon-180B, Sarathi-Serve provides up to 5.6x gain in the end-to-end serving capacity. The source code for Sarathi-Serve is available at https://github.com/microsoft/sarathi-serve.

This paper has not been read by Pith yet.

discussion (0)

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

Forward citations

Cited by 26 Pith papers

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

  1. Beyond Prediction: Tail-Aware Scheduling for LLM Inference

    cs.LG 2026-06 unverdicted novelty 7.0

    Presents a distribution-aware scheduling framework for LLM inference that reduces P99 TTLT by 35-50% and TTFT by 34-47% versus SRPT with perfect length knowledge using statistical signals instead of predictions.

  2. ViBE: Co-Optimizing Workload Skew and Hardware Variability for MoE Serving

    cs.DC 2026-05 unverdicted novelty 7.0

    ViBE co-optimizes expert placement with measured GPU performance variability in MoE inference to cut execution-time imbalance, delivering 14% better SLO attainment and up to 45% lower P90 TTFT.

  3. Dooly: Configuration-Agnostic, Redundancy-Aware Profiling for LLM Inference Simulation

    cs.DC 2026-05 unverdicted novelty 7.0

    Dooly reduces LLM inference profiling costs by 56.4% via configuration-agnostic taint-based labeling and selective database reuse, delivering simulation accuracy within 5% MAPE for TTFT and 8% for TPOT across 12 models.

  4. Agentic Witnessing: Pragmatic and Scalable TEE-Enabled Privacy-Preserving Auditing

    cs.CR 2026-04 unverdicted novelty 7.0

    Agentic Witnessing enables privacy-preserving auditing of semantic properties in private data by running an LLM auditor in a TEE that answers binary queries and produces cryptographic transcripts of its reasoning.

  5. Think Before You Grid-Search: Floor-First Triage for LLM Serving

    cs.PF 2026-07 conditional novelty 6.0

    A five-dimensional resource-vector floor model computes latency bounds and capacity walls for LLM serving, predicting when TP16 or EP16+DP attention layouts dominate based on operating point.

  6. OmniPilot: An Uncertainty-Aware LLM Inference Advisor for Heterogeneous GPU Clusters

    cs.DC 2026-07 unverdicted novelty 6.0

    OmniPilot combines conformal quantile regression with OOD detection to rank LLM serving configurations on mixed GPUs, reporting 6.2% MAPE throughput prediction and 95% top-1 accuracy on 460 benchmark runs while abstai...

  7. KernelSight-LM: A Kernel-Level LLM Inference Simulator

    cs.PF 2026-06 unverdicted novelty 6.0

    KernelSight-LM simulates LLM inference at kernel granularity with cross-generation (12.1% per-kernel error) and target-measured (3.8% error) tiers, yielding end-to-end median errors of 15.4%/12.8%/3.0% and 14.3%/6.2%/...

  8. KernelSight-LM: A Kernel-Level LLM Inference Simulator

    cs.PF 2026-06 unverdicted novelty 6.0

    KernelSight-LM simulates token-level LLM inference to predict per-kernel latencies and end-to-end metrics (TTFT, TPOT, throughput) with 12.1% and 3.8% kernel errors in cross-generation and target-measured tiers.

  9. PersistentKV: Page-Aware Decode Scheduling for Long-Context LLM Serving on Commodity GPUs

    cs.LG 2026-06 unverdicted novelty 6.0

    PersistentKV is a native block-table decode attention engine with page-aware workqueue scheduling that improves decode throughput 1.04-1.40x versus FlashInfer on RTX 3060 for selected long-context GQA workloads.

  10. Vortex: Efficient and Programmable Sparse Attention Serving for AI Agents

    cs.AI 2026-06 unverdicted novelty 6.0

    Vortex provides a programmable frontend and backend for sparse attention in LLM serving, delivering up to 3.46x throughput over full attention while preserving accuracy.

  11. A Paired Testing Protocol for Batch-Conditioned Refusal Robustness in LLM Serving

    cs.LG 2026-05 unverdicted novelty 6.0

    The paper introduces a paired testing protocol for batch-conditioned refusal robustness in LLM serving and reports low rates of genuine safety-label flips after adjudication, with a batch-invariant kernel ablation eli...

  12. Dooly: Configuration-Agnostic, Redundancy-Aware Profiling for LLM Inference Simulation

    cs.DC 2026-05 unverdicted novelty 6.0

    Dooly reduces LLM inference profiling GPU-hours by 56.4% across 12 models while keeping simulation MAPE under 5% for TTFT and 8% for TPOT by making profiling configuration-agnostic and redundancy-aware.

  13. Hive: A Multi-Agent Infrastructure for Algorithm- and Task-Level Scaling

    cs.AI 2026-04 unverdicted novelty 6.0

    Hive is a multi-agent infrastructure with a logits cache for reducing cross-path redundancy in sampling and agent-aware scheduling for better compute and KV-cache allocation, shown to deliver 1.11x-1.76x speedups and ...

  14. PipeWeave: Synergizing Analytical and Learning Models for Unified GPU Performance Prediction

    cs.PF 2026-01 unverdicted novelty 6.0

    PipeWeave predicts GPU kernel performance with 6.1% average error and end-to-end inference with 8.5% error by feeding analytical pipeline features into ML, cutting prior method errors by 4-7x across 11 GPUs.

  15. Omni-Flow: A Unified Workflow Orchestration and Distributed KV Cache Sharing Framework for Multimodal Inference

    cs.DC 2026-06 unverdicted novelty 5.0

    Omni-Flow introduces a three-layer abstraction (Control Flow, Data Flow, Compute Flow) for unified orchestration and KV cache sharing in multimodal inference pipelines.

  16. PersistentKV: Page-Aware Decode Scheduling for Long-Context LLM Serving on Commodity GPUs

    cs.LG 2026-06 unverdicted novelty 5.0

    PersistentKV is a new decode attention engine and adaptive page-aware scheduler that improves LLM serving throughput by 1.06-1.4x on long-context workloads via workload-specific selection between its workqueue/sequenc...

  17. Speculative Decoding at Temperature Zero: A Scoped Safety-Invariance Screen with a 48,072-Sample Expansion

    cs.LG 2026-06 unverdicted novelty 5.0

    No detectable safety divergence between target-only and speculative decoding at temperature zero under TAIS criteria on 48,072 samples across safety benchmarks.

  18. Load Testing for Machine Learning Model Serving Systems at Scale

    cs.LG 2026-06 unverdicted novelty 5.0

    Sys is an adaptive load testing framework that reduces ML serving capacity estimation error from ~30% to 2-6% via workload calibration and warmup handling across 14 industrial case studies.

  19. DisagFusion: Asynchronous Pipeline Parallelism and Elastic Scheduling for Disaggregated Diffusion Serving

    cs.DC 2026-05 unverdicted novelty 5.0

    DisagFusion achieves 3.4x-20.5x higher throughput and 18.5x lower latency for diffusion serving via asynchronous pipeline parallelism and elastic hybrid scheduling on disaggregated hardware.

  20. HarnessAPI: A Skill-First Framework for Unified Streaming APIs and MCP Tools

    cs.AI 2026-05 unverdicted novelty 5.0

    HarnessAPI derives streaming HTTP endpoints, OpenAPI UI, and MCP tools from a single handler.py plus Pydantic schemas, cutting framework boilerplate by 74%.

  21. Agentic AI Systems Should Be Designed as Marginal Token Allocators

    cs.AI 2026-05 unverdicted novelty 5.0

    Agentic AI systems should be designed as marginal token allocators that balance benefit against cost, latency, and risk across their layers rather than as unit-priced text generators.

  22. ODMA: On-Demand Memory Allocation Strategy for LLM Serving on LPDDR-Class Accelerators

    cs.AR 2025-12 unverdicted novelty 5.0

    ODMA raises KV-cache utilization by up to 19.25% and throughput by 23-27% on Cambricon MLU accelerators by dynamically adjusting prediction buckets and using a safety pool for LLM serving.

  23. ServeGen: Workload Characterization and Generation of Large Language Model Serving in Production

    cs.DC 2025-05 unverdicted novelty 5.0

    ServeGen characterizes production LLM inference workloads across model types and generates realistic per-client composed workloads that reduce under-provisioning by 50% in a production validation.

  24. Computational Challenges in Token Economics: Bridging Economic Theory and AI System Design

    cs.AI 2026-05 unverdicted novelty 4.0

    The paper defines Computational Token Economics and introduces the Token Economics Trilemma as a framework for trade-offs in granularity, real-time performance, and optimality, while outlining a research agenda for th...

  25. Token-Operations-Oriented Inference Optimization Techniques for Large Models

    cs.SE 2026-06 unverdicted novelty 3.0

    The paper introduces a four-layer technical architecture for token-operations-oriented inference optimization in large models and reviews key technologies and industry status at each layer.

  26. A Survey on Efficient Inference for Large Language Models

    cs.CL 2024-04 accept novelty 3.0

    The paper surveys techniques to speed up and reduce the resource needs of LLM inference, organized by data-level, model-level, and system-level changes, with comparative experiments on representative methods.