A metaheuristic method for joint task scheduling and virtual machine placement in cloud data centers

Future Generation Computer Systems(2021)

引用 45|浏览42
暂无评分
摘要
The virtual machine (VM) allocation problem is one of the main issues in cloud data centers. This article proposes a new metaheuristic method to optimize joint task scheduling and VM placement (JTSVMP) in cloud data center. The JTSVMP problem, though composed of two parts, namely task scheduling and VM placement, is treated as a joint problem to be resolved by using metaheuristic optimization algorithms (MOAs). The proposed co-optimization process aims to schedule task into the VM which has the least execution cost within deadline constraint and then to place the selected VM on most utilized physical host (PH) within capacity constraint. To evaluate the performance of our proposed co-optimization process, we compare the performances of two different scenarios, i.e., task scheduling algorithms and integrateion co-optimization of task scheduling and VM placement using MOAs, namely the basic glowworm swarm optimization (GSO), moth-flame glowworm swarm optimization (MFGSO) and genetic algorithm (GA). Simulation results show that optimizing joint task scheduling and VM placement leads to better overall results in terms of minimizing execution cost, makespan and degree of imbalance and maximizing PHs resource utilization.
更多
查看译文
关键词
Cloud,Data center,Metaheuristic,Task scheduling,Virtual machine placement
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要