Math 2.0

Resources / preprint

DynaSPLIT: Strong tail-optimal scheduling for the M/G/n with heavy-tailed job sizes F6GD5JWK9M

URIm2://res/F6GD5JWK9M
Kindpreprint
CreatorsZhouzi Li, Mor Harchol-Balter, Alan Scheller-Wolf
Date2026-10-12
Subjectsarxiv cs.PF, arxiv math.PR
Scopeborder

Expressions

e1: version, preprint

Date2026-10-12
IdsarXiv 2610.17329

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
Small-job contributionstatementproposition 4.15arxiv
Relevant-work comparisonstatementlemma 4.7arxiv
Strong tail optimality of \DynoSPLIT, explicit formstatementtheorem 4.21arxiv
Tagged-job response-time boundstatementlemma 4.9arxiv
Verification of the threshold conditionsstatementlemma A.3arxiv
Strong tail optimality of \DynoSPLITstatementtheorem 3.3arxiv
Recovery debt and effective capacitystatementlemma 4.3arxiv
Large-job contributionstatementproposition 4.19arxiv
Conditional collision boundstatementlemma 4.17arxiv
Exceptional events are rarestatementcorollary 4.5arxiv
Anchordefinitiondefinition 3.1arxiv
QQBR2QC1DYstatementlemma 4.1arxiv
Small-job pathwise reductionstatementlemma 4.11arxiv
Tail workstatementlemma A.1arxiv
\DynoSPLIT with capacity margin \(\varepsilon\definitiondefinition 3.2arxiv
Capped work rarely exceeds the marginstatementlemma 4.13arxiv

Catalogue records