Virtual machine allocation in cloud computing for minimizing total execution time on each machine
Authors:
- 1 January 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 241-245
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computingFuture Generation Computer Systems, 2012
- Energy-Aware Scheduling in Virtualized Datacenters2010
- A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data CentersIEEE Transactions on Services Computing, 2010
- Combining batch execution and leasing using virtual machines2008
- LP-based online scheduling: from single to parallel machinesMathematical Programming, 2008
- Scheduling Unrelated Machines by Randomized RoundingSIAM Journal on Discrete Mathematics, 2002