arXiv (All)
open access
LLM Serving Optimization with Variable Prefill and Decode Lengths
We study offline scheduling for large language model (LLM) serving under a fixed KV-cache memory budget, where requests have heterogeneous prompt (prefill) and response (decode) lengths. Given a backlog of requests available at time zero, the scheduler forms mixed prefill/decode batches over time to
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- From Spectra to Joint Schedules in LLM Pre-training: 3+3(+2) Scaling-Law Regimes#1154414
- From Spectra to Joint Schedules in LLM Pre-training: 3+3(+2) Scaling-Law Regimes#1136829
- Deadline-Aware Adaptive Prefill Chunking for Efficient Large Language Model Serving#985295
- What It Costs to Compose, Rebuild, and Correct Precomputed Memory#818703
- What It Costs to Compose, Rebuild, and Correct Precomputed Memory#808711
Record · ID 1141433
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive