|
|||||
|
|
| 一种改进型遗传算法的网格工作流调度研究 | |
| 引用本文： | 赵斌,宿玉佩,蒋念平.一种改进型遗传算法的网格工作流调度研究[J].河南科技大学学报(自然科学版),2012,33(3):32-35,111. |
| 作者姓名： | 赵斌 宿玉佩 蒋念平 |
| 作者单位： | 1. 洛阳师范学院计算机系,河南洛阳,471022 2. 重庆医科大学附属第一医院,重庆,400016 3. 上海理工大学光电信息与计算机工程学院,上海,200093 |
| 摘 要： | 用有向无环图表示的网格工作流调度问题是一种典型的NP-完全问题,因而,有效的调度算法是必不可少的。为解决这一问题,提出了一种改进型的遗传算法。运用适应度差的染色体与最优个体进行二级优先杂交和变异,不仅保障了种群的多样性,也提高了种群的收敛速度。采用Gridsim工具进行模拟后,证实该算法较标准的遗传算法更适用、更有效。 |
| 关 键 词： | 网格工作流 调度问题 改进型遗传算法 二级优先杂交和变异 |
Research on Grid Workflow Scheduling Based on Improved Genetic Algorithm |
|
| ZHAO Bin,SU Yu-Pei,JIANG Nian-Ping.Research on Grid Workflow Scheduling Based on Improved Genetic Algorithm[J].Journal of Henan University of Science & Technology:Natural Science,2012,33(3):32-35,111. | |
| Authors: | ZHAO Bin SU Yu-Pei JIANG Nian-Ping |
| Institution: | 1.Department of Computer Science,Luoyang Normal University,Luoyang 471022,China;2.The First Affiliated Hospital,Chongqing Medical University,Chongqing 400016,China;3.School of Optical-Electrical & Computer Engineering,Shanghai University of Science & Technology,Shanghai 200093,China) |
| Abstract: | Grid workflow scheduling represented by directed acyclic graph(DAG) is a typical NP-complete problem,and thus a scheduling algorithm of high efficiency is required.So an improved genetic algorithm was proposed to solve this problem.In the algorithm,chromosomes of poor fitness made secondary preferential hybridization and mutation with the overall best individual.It not only guarantees the population diversity but increases the convergence rate of population.Simulation results based on Gridsim show that the improved algorithm is available and better than standard genetic algorithm |
| Keywords: | Grid workflow Scheduling problem Improved genetic algorithm Secondary preferential hybridization and mutation |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |