5 papers
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.…
Mean field optimal Core Allocation across Malleable jobs
Zhouzi Li, Mor Harchol-Balter, Benjamin Berg
Modern data centers and cloud computing clusters are increasingly running workloads composed of malleable jobs. A malleable job can be parallelized across any number of cores, yet…
BOA Constrictor: Squeezing Performance out of GPUs in the Cloud via Budget-Optimal Allocation
Zhouzi Li, Cindy Zhu, Arpan Mukhopadhyay +2
The past decade has seen a dramatic increase in demand for GPUs to train Machine Learning (ML) models. Because it is prohibitively expensive for most organizations to build and mai…
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…