On the cluster admission problem for cloud computing
Ludwig Dierks, Ian A. Kash, Sven Seuken

TL;DR
This paper introduces advanced admission policies for cloud clusters that significantly improve resource utilization by modeling workload behavior and incentivizing user information sharing, surpassing traditional threshold methods.
Contribution
It formalizes the cluster admission problem as a POMDP and develops policies that estimate workload usage, demonstrating substantial efficiency gains through simulations.
Findings
Improved cluster utilization over threshold policies
Workload distribution estimation enhances admission decisions
Information elicitation further boosts resource efficiency
Abstract
Cloud computing providers face the problem of matching heterogeneous customer workloads to resources that will serve them. This is particularly challenging if customers, who are already running a job on a cluster, scale their resource usage up and down over time. The provider therefore has to continuously decide whether she can add additional workloads to a given cluster or if doing so would impact existing workloads' ability to scale. Currently, this is often done using simple threshold policies to reserve large parts of each cluster, which leads to low efficiency (i.e., low average utilization of the cluster). We propose more sophisticated policies for controlling admission to a cluster and demonstrate that they significantly increase cluster utilization. We first introduce the cluster admission problem and formalize it as a constrained Partially Observable Markov Decision Process…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
