Name
Abstract | ||
|---|---|---|
While cloud platforms enable users to rent computing resources on demand to execute their jobs, buying fixed resources is still much cheaper than renting if their utilization is high. Thus, optimizing cloud costs requires users to determine how many fixed resources to buy versus rent based on their workload. In this paper, we introduce the concept of a waiting policy for cloud-enabled schedulers, which is the dual of a scheduling policy, and show that the optimal cost depends on it. We define multiple waiting policies and develop simple analytical models to reveal their tradeoff between fixed resource provisioning, cost, and job waiting time. We evaluate the impact of these waiting policies on a year-long production batch workload consisting of 14Mjobs run on a 14.3k-core cluster, and show that a compound waiting policy decreases the cost (by 5%) and mean job waiting time (by 7×) compared to a fixed cluster of the current size. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/SC41405.2020.00071 | SC20: International Conference for High Performance Computing, Networking, Storage and Analysis |
Keywords | DocType | ISBN |
fixed resources,cloud-enabled schedulers,scheduling policy,optimal cost,multiple waiting policies,fixed resource provisioning,job waiting time,compound waiting policy,fixed cluster,waiting game,cloud platforms,rent computing resources,cloud costs,production batch workload | Conference | 978-1-7281-9999-3 |
Citations | PageRank | References |
2 | 0.37 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pradeep Ambati | 1 | 2 | 2.06 |
| Noman Bashir | 2 | 2 | 1.38 |
| David E. Irwin | 3 | 7 | 5.00 |
| Prashant J. Shenoy | 4 | 6386 | 521.30 |