Quantifying the Performance Gap for Simple Versus Optimal Dynamic Server Allocation Policies
By: Niklas Carlsson, Derek Eager
Potential Business Impact:
Makes computer servers work smarter, saving money.
Cloud computing enables the dynamic provisioning of server resources. To exploit this opportunity, a policy is needed for dynamically allocating (and deallocating) servers in response to the current load conditions. In this paper we describe several simple policies for dynamic server allocation and develop analytic models for their analysis. We also design semi-Markov decision models that enable determination of the performance achieved with optimal policies, allowing us to quantify the performance gap between simple, easily implemented policies, and optimal policies. Finally, we apply our models to study the potential performance benefits of state-dependent routing in multi-site systems when using dynamic server allocation at each site. Insights from our results are valuable to service providers wanting to balance cloud service costs and delays.
Similar Papers
The Merit of Simple Policies: Buying Performance With Parallelism and System Architecture
Distributed, Parallel, and Cluster Computing
Makes computer jobs finish faster with smart server setups.
Machine learning-based cloud resource allocation algorithms: a comprehensive comparative review
Distributed, Parallel, and Cluster Computing
Makes computers use cloud power smarter and cheaper.
Optimal Configuration of API Resources in Cloud Native Computing
Distributed, Parallel, and Cluster Computing
Makes computer programs run faster by tuning their settings.