arXiv (All)
open access
Online Batching with Lookahead: Adversarial Limits and Stochastic Gains
Modern inference systems rely on batching to exploit parallel execution and amortize serial execution overheads, but batching creates a fundamental online scheduling tradeoff: serving requests immediately reduces request queuing delay, while waiting can form larger batches that better utilize parall
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
- Approximation Algorithms for Dual-Memory Request Scheduling in Disaggregated LLM Inference#1326829
- TROVE: Adaptive Agent Skill Orchestration via Trace-Grounded Route Validation and Editing#971975
- Same Request, Different Answer: Quantization Amplifies Cache-Induced Divergence in LLM Serving#971420
- Pushing CPU Speech Synthesis to the Wall: Extreme Inference Tuning under Serverless Architecture and Billing#1154686
- ViBE: Co-Optimizing Workload Skew and Hardware Variability for MoE Serving#246529
Record · ID 1327603
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