arXiv (All)
open access
Approximation Algorithms for Dual-Memory Request Scheduling in Disaggregated LLM Inference
Disaggregated LLM inference executes the prefill and decode phases on separate resource pools, reducing interference between the two phases. However, this architecture introduces a coupled scheduling problem because a request that completes prefill retains its prompt KV cache in prefill memory until
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
- KV-Kaizen: Learning Context-Adaptive Cache Compression Choices#1144877
- KV-Kaizen: Learning Context-Adaptive Cache Compression Choices#1122339
- OpWeave: Flexible Operator Disaggregation for Heterogeneous LLM Serving#1083694
- OpWeave: Flexible Operator Disaggregation for Heterogeneous LLM Serving#919364
- Range: Decoupling KV-Cache Reuse Granularity from Storage Work#1356577
Record · ID 1326829
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