Energy-Efficient Dynamic Virtual Machine Management in Data Centers

被引:21
作者
Han, Zhenhua [1 ,2 ]
Tan, Haisheng [1 ]
Wang, Rui [3 ]
Chen, Guihai [4 ]
Li, Yupeng [2 ]
Lau, Francis Chi Moon [2 ]
机构
[1] Univ Sci & Technol China, Sch Comp Sci & Technol, Hefei 230022, Anhui, Peoples R China
[2] Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
[3] Southern Univ Sci & Technol, Dept Elect & Elect Engn, Shenzhen 518055, Peoples R China
[4] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China
关键词
Cloud computing; resource management; energy efficiency; Markov decision process; PLACEMENT; CONSOLIDATION; ALGORITHMS;
D O I
10.1109/TNET.2019.2891787
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Efficient virtual machine (VM) management can dramatically reduce energy consumption in data centers. Existing VM management algorithms fall into two categories based on whether the VMs' resource demands are assumed to be static or dynamic. The former category fails to maximize the resource utilization as they cannot adapt to the dynamic nature of VMs' resource demands. Most approaches in the latter category are heuristic and lack theoretical performance guarantees. In this paper, we formulate the dynamic VM management as a large-scale Markov decision process (MDP) problem and derive an optimal solution. Our analysis of real-world data traces supports our choice of the modeling approach. However, solving the large-scale MDP problem suffers from the curse of dimensionality. Therefore, we further exploit the special structure of the problem and propose an approximate MDP-based dynamic VM management method, called MadVM. We prove the convergence of MadVM and analyze the bound of its approximation error. Moreover, we show that MadVM can be implemented in a distributed system with at most two times of the optimal migration cost. Extensive simulations based on two real-world workload traces show that MadVM achieves significant performance gains over two existing baseline approaches in power consumption, resource shortage, and the number of VM migrations. Specifically, the more intensely the resource demands fluctuate, the more MadVM outperforms.
引用
收藏
页码:344 / 360
页数:17
相关论文
共 49 条
[1]  
Alicherry M, 2013, IEEE INFOCOM SER, P647
[2]  
[Anonymous], 2013, THESIS
[3]  
[Anonymous], 2010, EPRINT ARXIV
[4]  
[Anonymous], 2011, P 2 ACM S CLOUD COMP
[5]  
[Anonymous], P 8 USENIX C NETW SY
[6]  
[Anonymous], 2015, Mathematical statistics: basic ideas and selected topics
[7]  
[Anonymous], 2010, IEEE 16 INT S HIGH P, DOI DOI 10.1109/HPCA.2010.5463056
[8]   STATISTICAL INFERENCE FOR PROBABILISTIC FUNCTIONS OF FINITE STATE MARKOV CHAINS [J].
BAUM, LE ;
PETRIE, T .
ANNALS OF MATHEMATICAL STATISTICS, 1966, 37 (06) :1554-&
[9]  
Bellman R.E., 1957, DYNAMIC PROGRAMMING
[10]  
Beloglazov Anton, 2010, Proceedings 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing (CCGrid), P826, DOI 10.1109/CCGRID.2010.46