7 citations · 7 across the 1 of their papers we have counts for
2 papers
cs.DC2020★ 7 cited
heSRPT: Parallel Scheduling to Minimize Mean Slowdown
Benjamin Berg, Rein Vesilo, Mor Harchol-Balter
Modern data centers serve workloads which are capable of exploiting parallelism. When a job parallelizes across multiple servers it will complete more quickly, but jobs receive dim…
cs.PF2019
heSRPT: Optimal Parallel Scheduling of Jobs With Known Sizes
Benjamin Berg, Rein Vesilo, Mor Harchol-Balter
When parallelizing a set of jobs across many servers, one must balance a trade-off between granting priority to short jobs and maintaining the overall efficiency of the system. Whe…