Reproduce “DynaSPLIT: Strong tail-optimal scheduling for the M/G/n with heavy-tailed job sizes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Zhouzi Li, Mor Harchol-Balter, Alan Scheller-Wolf
DynaSPLIT allocates capacity among jobs in a high-load, multi-server queue. It assumes Poisson arrivals, known preemptible job sizes, fractional service sharing, and regularly varying job sizes with finite mean. Its size-dependent allocation gives the largest job a share of spare capacity while retaining a positive margin for other work. For loads in the range, its response-time tail asymptotically matches the super-server lower bound.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.