arXiv (All)
open access
Outperforming Multiserver SRPT at All Loads
A well-designed scheduling policy can unlock significant performance improvements with no additional resources. Multiserver SRPT (SRPT-k) is known to achieve asymptotically optimal mean response time in the heavy-traffic limit, as load approaches capacity. No better policy is known for the M/G/k que
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
- DARTS: Targeting Prognostic Covariates in Budget-Constrained Sequential Experiments#168318
- Efficient protocol for the Markovian Mpemba effect in $N$-level systems#996792
- An Analysis of Scaling Issues in MPLS-TE Core Networks#209095
- The Joule Point: an Energy-Optimal Operating Point for AI Inference#1064470
- Beyond 1$\to$N Decoding: Capacity-Aware Rateless Polar Codes for IR-HARQ#246495
Record · ID 1247303
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