| 基于改进遗传算法的网格任务调度算法 |
| |
| 引用本文： | 吴德鹏,张建. 基于改进遗传算法的网格任务调度算法[J]. 计算机应用与软件, 2009, 26(3) |
| |
| 作者姓名： | 吴德鹏 张建 |
| |
| 作者单位： | 上海大学计算机工程与科学学院,上海,200072;上海大学计算机工程与科学学院,上海,200072 |
| |
| 摘 要： | 网格任务调度是一个NP完全问题,它关注大规模的资源和任务调度,要求采用的调度算法能够具有高效性.遗传算法被证明是解决这类小规模问题的有效算法,随着任务数和资源数的增加,遗传算法表现出慢速收敛的缺点.为了克服其缺点,提出将Min-min算法与遗传算法相结合的改进遗传算法,从而设计出很好的选择和交叉算子,提高了算法搜索能力和收敛速度.仿真结果表明该算法能更有效解决网格任务调度问题.
|
| 关 键 词： | 网格计算 任务调度 遗传算法 Min-min算法 时间跨度 |
GRID TASK SCHEDULING ALGORITHM BASED ON IMPROVED GENETIC ALGORITHM |
| |
| WU Depeng,ZHANG Jian. GRID TASK SCHEDULING ALGORITHM BASED ON IMPROVED GENETIC ALGORITHM[J]. Computer Applications and Software, 2009, 26(3) |
| |
| Authors: | WU Depeng ZHANG Jian |
| |
| Affiliation: | School of Computer Engineering and Science;Shanghai University;Shanghai 200072;China |
| |
| Abstract: | Grid task scheduling is a NP-complete problem which concerns the scheduling of tasks and resources in a large scale,and thus a scheduling algorithm of high efficiency is required.Genetic algorithm has been proven to be an effective method to solve this problem in small scale,but it has a drawback of slow convergence as the number of tasks and resources increases.In order to overcome this drawback,in this paper it provides a method of an improved genetic algorithm which integrates genetic algorithm with Min-... |
| |
| Keywords: | Grid computing Task scheduling Genetic algorithm Min-min algorithm Makespan |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
