首页> 外文会议>Algorithms and architectures for parallel processing >Research of Improved Particle Swarm Optimization Based on Genetic Algorithm for Hadoop Task Scheduling Problem
【24h】

Research of Improved Particle Swarm Optimization Based on Genetic Algorithm for Hadoop Task Scheduling Problem

机译:基于遗传算法的改进粒子群算法在Hadoop任务调度中的研究

获取原文
获取原文并翻译 | 示例

摘要

Scheduling is NP-hard problem in Hadoop, because scheduling algorithm must use available resources to complete assignments in the shortest time. This paper proposes an improved Genetic-Particle Swarm Optimization (IG-PSO) algorithm to solve scheduling problems. Traditional PSO algorithm is easy to fall into local optimum solution, so novel improved Genetic-Particle Swarm Optimization (IG-PSO) algorithm introduced GA's mutation and crossover to overcome the shortcoming and increase the ability of global optimization. Compared with traditional PSO and GA, the experiment simulation shows that IG-PSO algorithm can escape from local optimal solution and find a better global optimal solution. Because the position of PSO particle falls into local optimal solution, GA uses mutation and crossover to diversify particles, which make the particle escape out of local optima.
机译:在Hadoop中,调度是NP难题,因为调度算法必须使用可用资源在最短的时间内完成分配。提出了一种改进的遗传粒子群算法(IG-PSO)来解决调度问题。传统的粒子群优化算法很容易陷入局部最优解,因此新的改进的遗传粒子群算法(IG-PSO)引入了遗传算法的变异和交叉,克服了缺点,提高了全局优化的能力。与传统的PSO和GA相比,实验仿真表明IG-PSO算法可以摆脱局部最优解,找到更好的全局最优解。由于PSO粒子的位置属于局部最优解,因此GA使用变异和交叉使粒子多样化,从而使粒子脱离了局部最优。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号