Wu, J.Shen, H.Chen, G.Shen, H.Chen, M.2019-01-132019-01-132017Communications in Computer and Information Science, 2017 / Chen, G., Shen, H., Chen, M. (ed./s), vol.729, pp.353-36597898110644181865-09291865-0937http://hdl.handle.net/2440/117200Virtual machine (VM) placement problem is a major issue in cloud data center. With the rapid development of cloud computing, efficient algorithms are needed to reduce the power consumption and save energy in data centers. Many models and algorithms are designed with an objective to minimize the number of physical machines (PMs) used in cloud data center. In this paper, we take into account the execution time of the PM, and formulate a new optimization problem of VM placement, which aims to minimize the total execution time of the PMs. We discuss the NP-hardness of the problem, and present heuristic algorithms to solve it under both offline and online scenario. Furthermore, we conduct experiments to evaluate the performance of the proposed algorithms and the result show that our methods are able to perform better than other commonly used algorithms.en© Springer Nature Singapore Pte Ltd. 2017Cloud data centervirtual machine placementbin packingHeuristic algorithmConference paper003007704010.1007/978-981-10-6442-5_320004524477000322-s2.0-85031421259372203Shen, H. [0000-0002-3663-6591] [0000-0003-0649-0648]