Virtual machine placement for predictable and time-constrained peak loads

  • Authors:
  • Wubin Li;Johan Tordsson;Erik Elmroth

  • Affiliations:
  • Department of Computing Science and HPC2N, Umeå University, Umeå, Sweden;Department of Computing Science and HPC2N, Umeå University, Umeå, Sweden;Department of Computing Science and HPC2N, Umeå University, Umeå, Sweden

  • Venue:
  • GECON'11 Proceedings of the 8th international conference on Economics of Grids, Clouds, Systems, and Services
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an approach to optimal virtual machine placement within datacenters for predicable and time-constrained load peaks. A method for optimal load balancing is developed, based on binary integer programming. For tradeoffs between quality of solution and computation time, we also introduce methods to pre-process the optimization problem before solving it. Upper bound based optimizations are used to reduce the time required to compute a final solution, enabling larger problems to be solved. For further scalability, we also present three approximation algorithms, based on heuristics and/or greedy formulations. The proposed algorithms are evaluated through simulations based on synthetic data sets. The evaluation suggests that our algorithms are feasible, and that these can be combined to achieve desired tradeoffs between quality of solution and execution time.