A Multi-resource Sharing-Aware Approximation Algorithm for Virtual Machine Maximization

Cloud providers face the challenge of efficiently managing their infrastructure through minimizing resource consumption while allocating requests such that their profit is maximized. We address this challenge by designing a greedy approximation algorithm for solving the multi-resource sharing-aware virtual machine maximization (MSAVMM) problem. The MSAVMM problem requires determining the set of VMs that can be instantiated on a given server such that the profit derived from hosting the VMs is maximized. The solution to this problem has to consider the sharing of memory pages among VMs and the restricted capacities of each type of resource requested by the VMs. We analyze the performance of the proposed algorithm by determining its approximation ratio and by performing extensive experiments against other sharing-aware VM allocation algorithms.