4 papers · 1 filter
DynaSPLIT: Strong tail-optimal scheduling for the M/G/n with heavy-tailed job sizes
Zhouzi Li, Mor Harchol-Balter, Alan Scheller-Wolf
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 lo…
SPLIT: SymPathy for Large jobs Improves Tail latency
Zhouzi Li, Mor Harchol-Balter, Alan Scheller-Wolf
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.…
LookAhead: The Optimal Non-decreasing Index Policy for a Time-Varying Holding Cost problem
Keerthana Gurushankar, Zhouzi Li, Mor Harchol-Balter +1
In practice, the cost of delaying a job can grow as the job waits. Such behavior is modeled by the Time-Varying Holding Cost (TVHC) problem, where each job's instantaneous holding…
Improving Upon the generalized c-mu rule: a Whittle approach
Zhouzi Li, Keerthana Gurushankar, Mor Harchol-Balter +1
Scheduling a stream of jobs whose holding cost changes over time is a classic and practical problem. Specifically, each job is associated with a holding cost (penalty), where a job…