| 基于关键路径知识的任务调度遗传算法 |
| |
| 引用本文： | 兰舟,孙世新. 基于关键路径知识的任务调度遗传算法[J]. 计算机应用, 2008, 28(2): 272-274 |
| |
| 作者姓名： | 兰舟 孙世新 |
| |
| 作者单位： | 电子科技大学,计算机科学与工程学院,成都,610054;电子科技大学,计算机科学与工程学院,成都,610054 |
| |
| 摘 要： | 基于遗传算法提出了一种新颖的多处理器任务调度算法CPGS。该算法利用任务系统的关键路径知识，构造了性能良好的初始种群。借助第三方测试数据集，将CPGS算法同其他类似算法进行了对比。实验结果表明，CPGS算法性能优于已有的同类算法。
|
| 关 键 词： | 遗传算法 任务调度 关键路径 多处理器系统 |
| 文章编号： | 1001-9081（2008）02-0272-03 |
| 收稿时间： | 2007-09-10 |
| 修稿时间： | 2007-11-24 |
Genetic algorithm based on critical path for task scheduling |
| |
| LAN Zhou,SUN Shi-xin. Genetic algorithm based on critical path for task scheduling[J]. Journal of Computer Applications, 2008, 28(2): 272-274 |
| |
| Authors: | LAN Zhou SUN Shi-xin |
| |
| Affiliation: | LAN Zhou,SUN Shi-xin(School of Computer Science , Engineering,University of Electronic Science , Technology of China,Chengdu Sichuan 610054,China) |
| |
| Abstract: | In this paper,a novel genetic algorithm,namely critical path based genetic scheduling algorithm(CPGS),was developed for multiprocessor scheduling.CPGS made full use of the knowledge about the critical path to construct the initial population and provided the iterative evolution process with an improved basis.To compare CPGS' performance with the other GAs,the third-party dataset was selected as the simulation benchmark.Simulation results show that CPGS outperforms the previously existing algorithms. |
| |
| Keywords: | genetic algorithm task scheduling critical path muhiprocessor system |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
