A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
Utility Functions in Autonomic Systems
ICAC '04 Proceedings of the First International Conference on Autonomic Computing
Utility-Function-Driven Resource Allocation in Autonomic Systems
ICAC '05 Proceedings of the Second International Conference on Automatic Computing
Dynamic placement for clustered web applications
Proceedings of the 15th international conference on World Wide Web
Energy Efficient Allocation of Virtual Machines in Cloud Data Centers
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Hi-index | 0.00 |
In cloud computing environments, demands from different users are often handled on virtual machines (VMs) which are deployed over plenty of hosts. Huge amount of electrical power is consumed by these hosts and auxiliary infrastructures that support them. However, demands are usually time-variant and of some seasonal pattern. It is possible to reduce power consumption by forecasting varying demands periodically and allocating VMs accordingly. In this paper, we propose a power-saving approach based on demand forecast for allocation of VMs. First of all, we forecast demands of next period with Holt-Winters' exponential smoothing method. Second, a modified knapsack algorithm is used to find the appropriate allocation between VMs and hosts. Third, a self-optimizing module updates the values of parameters in Holt-Winters' model and determines the reasonable forecast frequency. We carried out a set of experiments whose results indicate that our approach can reduce the frequency of switching on/off hosts. In comparison with other approaches, this method leads to considerable power saving for cloud computing environments.