2 papers
cs.PF2025
Asymptotically Optimal Scheduling of Multiple Parallelizable Job Classes
Benjamin Berg, Benjamin Moseley, Weina Wang +1
Modern computing workloads are often composed of parallelizable jobs. A parallelizable job can be completed more quickly when run on additional servers. However, each job can only…
cs.PF2025
An Upper Bound on the M/M/k Queue With Deterministic Setup Times
Jalani Williams, Weina Wang, Mor Harchol-Balter
In many systems, servers do not turn on instantly; instead, a setup time must pass before a server can begin work. These "setup times" can wreak havoc on a system's queueing; this…