Probabilistic Virtual Machine Assignment

We cast the assignment of virtual machines (VMs) to physical servers as a variant of the classic bin packing problem. We then develop a model of VM load that can be used to produce assignments of VMs to servers. Using this problem formulation and model, we evaluate heuristic solutions to this problem. We evaluate the performance of these solutions in stochastic load environments. We verify the model proposed and show that it can be adapted to respond well to varying VM loads. Keywords-Energy optimization; Probabilistic Models

[1]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[2]  Suman Nath,et al.  Energy-Aware Server Provisioning and Load Dispatching for Connection-Intensive Internet Services , 2008, NSDI.

[3]  Michael Bailey,et al.  Operating System Power Dependencies , 2008, Int. CMG Conference.

[4]  Weisong Shi,et al.  Utility analysis for Internet-oriented server consolidation in VM-based data centers , 2009, 2009 IEEE International Conference on Cluster Computing and Workshops.

[5]  Feng Zhao,et al.  Energy aware consolidation for cloud computing , 2008, CLUSTER 2008.

[6]  Alan Kai-Hau Yeung,et al.  On the modeling of WWW request arrivals , 1999, Proceedings of the 1999 ICPP Workshops on Collaboration and Mobile Computing (CMC'99). Group Communications (IWGC). Internet '99 (IWI'99). Industrial Applications on Network Computing (INDAP). Multime.

[7]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[8]  Henri Casanova,et al.  Resource Allocation Using Virtual Clusters , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.

[9]  Hui Wang,et al.  Multi-Tiered On-Demand Resource Scheduling for VM-Based Data Center , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.

[10]  Philipp Rohlfshagen,et al.  A genetic algorithm with exon shuffling crossover for hard bin packing problems , 2007, GECCO '07.

[11]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[12]  Fred W. Glover,et al.  A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem , 2004, J. Heuristics.

[13]  Vipin Kumar,et al.  Multi-capacity bin packing algorithms with applications to job scheduling under multiple constraints , 1999, Proceedings of the 1999 International Conference on Parallel Processing.

[14]  Louis P. Slothouber,et al.  A Model of Web Server Performance , 1996 .

[15]  Karsten Schwan,et al.  E2EProf: Automated End-to-End Performance Management for Enterprise Systems , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[16]  Karsten Schwan,et al.  VirtualPower: coordinated power management in virtualized enterprise systems , 2007, SOSP.