Virtual machine allocation in cloud computing for minimizing total execution time on each machine

This paper considers a virtual machine allocation problem. Each physical machine in cloud has a lot of virtual machines. Each job needs to use a number of virtual machines during a given and fixed period. The objective aims to minimize the cost induced by total execution time on each physical machine. This allocation problem is proved to be N P-hard. Additionally, three mixed integer linear mathematical models are constructed to represent and solve the problem. The performance comparison of the three proposed models is analyzed through some empirical results.

[1]  Rina Panigrahy,et al.  Heuristics for Vector Bin Packing , 2011 .

[2]  Jordi Torres,et al.  Energy-Aware Scheduling in Virtualized Datacenters , 2010, 2010 IEEE International Conference on Cluster Computing.

[3]  Douglas G. Down,et al.  Power-Aware Linear Programming based Scheduling for heterogeneous computer clusters , 2010, International Conference on Green Computing.

[4]  Martin Skutella,et al.  Scheduling Unrelated Machines by Randomized Rounding , 2002, SIAM J. Discret. Math..

[5]  Nam Thoai,et al.  Performance Constraint and Power-Aware Allocation For User Requests In Virtual Computing Lab , 2012, ArXiv.

[6]  Martin Bichler,et al.  A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers , 2010, IEEE Transactions on Services Computing.

[7]  Rajkumar Buyya,et al.  Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computing , 2012, Future Gener. Comput. Syst..

[8]  José R. Correa,et al.  LP-based online scheduling: from single to parallel machines , 2005, Math. Program..

[9]  Borja Sotomayor,et al.  Combining batch execution and leasing using virtual machines , 2008, HPDC '08.

[10]  Ian Foster,et al.  Provisioning computational resources using virtual machines and leases , 2010 .

[11]  Sanjeev Khanna,et al.  On multi-dimensional packing problems , 2004, SODA '99.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .