Efficient algorithms for VM placement in cloud data center
Date
2017
Authors
Wu, J.
Shen, H.
Editors
Chen, G.
Shen, H.
Chen, M.
Shen, H.
Chen, M.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Communications in Computer and Information Science, 2017 / Chen, G., Shen, H., Chen, M. (ed./s), vol.729, pp.353-365
Statement of Responsibility
Jiahuai Wu and Hong Shen
Conference Name
International Symposium on Parallel Architectures, Algorithms, and Programming (PAAP) (17 Jun 2017 - 18 Jun 2017 : Haikou, China)
Abstract
Virtual 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.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© Springer Nature Singapore Pte Ltd. 2017