arXiv (All)
open access
DynaSPLIT: Strong tail-optimal scheduling for the M/G/n with heavy-tailed job sizes
We study the asymptotic response time tail in the M/G/n queue with heavy-tailed (regularly varying) job sizes. For this setting, strongly tail optimal policies are known only at lower load, where n-1 servers suffice for stability. At higher load, the tail optimal scheduling has been open. This paper
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
- Pareto-Optimal Scheduling in the Half-batch Multiserver-job Model#1070872
- SPLIT: SymPathy for Large jobs Improves Tail latency#1341413
- Barnacle: Adaptive Multi-Leader Scheduling for DAG-Based Consensus#639599
- Review-Period Sensitivity in Multiclass Queue Scheduling#794192
- Review-Period Sensitivity in Multiclass Queue Scheduling#790173
Record · ID 1342205
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