Scheduling Live Migration of Virtual Machines

被引:20
作者
Kherbache, Vincent [1 ]
Madelaine, Eric [1 ]
Hermenier, Fabien [2 ]
机构
[1] Inria Ctr Rech Sophia Antipolis Mediterranee, Comp Sci, F-06902 Sophia Antipolis, Alpes Maritimes, France
[2] Univ Nice Sophia Antipolis, F-06000 Nice, France
关键词
Live migration; scheduling; virtual machines; PERFORMANCE; SIMULATION; PLACEMENT; POWER;
D O I
10.1109/TCC.2017.2754279
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Every day, numerous VMs are migrated inside a datacenter to balance the load, save energy or prepare production servers for maintenance. Although VM placement problems are carefully studied, the underlying migration schedulers rely on vague adhoc models. This leads to unnecessarily long and energy-intensive migrations. We present mVM, a new and extensible migration scheduler. To provide schedules with minimal completion times, mVM parallelizes and sequentializes the migrations with regards to the memory workload and the network topology. mVM is implemented as a plugin of BtrPlace and its current library allows administrators to address temporal and energy concerns. Experiments on a real testbed shows mVM outperforms state-of-the-art migration schedulers. Compared to schedulers that cap the migration parallelism, mVM reduces the individual migration duration by 20.4 percent on average and the schedule completion time by 28.1 percent. In a maintenance operation involving 96 VMs migrated between 72 servers, mVM saves 21.5 percent Joules against BtrPlace. Compared to the migration model inside the cloud simulator CloudSim, the prediction error of the migrations duration is about 5 times lower with mVM. By computing schedules involving thousands of migrations performed over various fat-tree network topologies, we observed that the mVM solving time accounts for about 1 percent of the schedule execution time.
引用
收藏
页码:282 / 296
页数:15
相关论文
共 33 条
[1]   EXTENDING CHIP IN ORDER TO SOLVE COMPLEX SCHEDULING AND PLACEMENT PROBLEMS [J].
AGGOUN, A ;
BELDICEANU, N .
MATHEMATICAL AND COMPUTER MODELLING, 1993, 17 (07) :57-73
[2]  
Akoush Sherif, 2010, Proceedings 18th IEEE/ACM International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems (MASCOTS 2010), P37, DOI 10.1109/MASCOTS.2010.13
[3]  
[Anonymous], [No title captured]
[4]  
[Anonymous], 2007, P LINUX S
[5]  
[Anonymous], 2009, Proceedings of the 2009 acm sigplan/sigops international conference on virtual execution environments, DOI DOI 10.1145/1508293.1508300
[6]  
[Anonymous], [No title captured]
[7]  
Bari MF, 2014, 2014 IFIP NETWORKING CONFERENCE
[8]  
Beloglazov Anton, 2010, Proceedings 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing (CCGrid), P826, DOI 10.1109/CCGRID.2010.46
[9]   SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY [J].
BLAZEWICZ, J ;
LENSTRA, JK ;
KAN, AHGR .
DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :11-24
[10]   Grid'5000:: A large scale and highly reconfigurable experimental grid testbed [J].
Bolze, Raphael ;
Cappello, Franck ;
Caron, Eddy ;
Dayde, Michel ;
Desprez, Frederic ;
Jeannot, Emmanuel ;
Jegou, Yvon ;
Lanteri, Stephane ;
Leduc, Julien ;
Melab, Noredine ;
Mornet, Guillaume ;
Namyst, Raymond ;
Primet, Pascale ;
Quetier, Benjamin ;
Richard, Olivier ;
Talbi, El-Ghazali ;
Touche, Irea .
INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2006, 20 (04) :481-494