【24h】

Research on Virtual Machine Layout Strategy Based on Improved Particle Swarm Optimization Algorithm

机译:基于改进粒子群算法的虚拟机布局策略研究

获取原文

摘要

In the cloud computing center, the scheduling module allocates virtual machines to physical servers according to the virtual machine's resource usage, regardless of the physical server's overall and long-term resource utilization, which causes a large amount of energy loss in the cloud computing center. The virtual machine placement algorithm provides a way to save energy and improve resource management. This paper proposes a particle swarm optimization algorithm with crossover operator (CPSO) to maximize the use of resources and reduce energy consumption. In the article we designed a new fitness function, which optimizes the algorithm from three goals: load balancing, resource utilization and physical server usage. By adding the crossover operator in the genetic algorithm to the particle swarm optimization algorithm, the fitness value can be prevented from entering the local optimum too early. The algorithm can adaptively adjust the crossover probability and speed up the convergence of the algorithm. Finally, the algorithm is evaluated experimentally. The results show that CPSO is superior to the discrete particle swarm optimization (DPSO) and greedy algorithm (Best-Fit) in terms of resource utilization and physical machine usage. And the solution obtained by the algorithm is close to the optimal solution.
机译:在云计算中心中,调度模块根据虚拟机的资源使用情况将虚拟机分配给物理服务器,而与物理服务器的整体和长期资源利用率无关,这会在云计算中心中造成大量能量损失。虚拟机放置算法提供了一种节省能源并改善资源管理的方法。提出了一种带有交叉算子(CPSO)的粒子群优化算法,以最大程度地利用资源并降低能耗。在本文中,我们设计了一个新的适应度函数,该函数从三个目标优化了算法:负载平衡,资源利用率和物理服务器利用率。通过将遗传算法中的交叉算子添加到粒子群优化算法中,可以防止适应度值过早进入局部最优值。该算法可以自适应地调整交叉概率并加快算法的收敛速度。最后,对该算法进行了实验评估。结果表明,在资源利用率和物理机利用率方面,CPSO优于离散粒子群优化(DPSO)和贪婪算法(Best-Fit)。该算法得到的解接近最优解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号