arXiv (All)
open access
SPLIT: SymPathy for Large jobs Improves Tail latency
We study the asymptotic response time tail in the M/G/n multi-server queue with heavy-tailed (regularly varying) job sizes, a setting representative of modern computing workloads. For single-server systems, tail optimization is well understood: under heavy-tailed job sizes, policies such as SRPT tha
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
- DynaSPLIT: Strong tail-optimal scheduling for the M/G/n with heavy-tailed job sizes#1342205
- HRRC on the Farm: Quantile Forecasting for Highly-Reliable Remote Control via LEO Networks#429307
- Caching for Dollars, Not Hits: An Exact Offline Reference for Cloud-Egress Caching and the Crossover That Decides When It Pays#290661
- Review-Period Sensitivity in Multiclass Queue Scheduling#794192
- Review-Period Sensitivity in Multiclass Queue Scheduling#790173
Record · ID 1341413
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