摘要
基于遗传算法提出了一种新颖的多处理器任务调度算法CPGS。该算法利用任务系统的关键路径知识,构造了性能良好的初始种群。借助第三方测试数据集,将CPGS算法同其他类似算法进行了对比。实验结果表明,CPGS算法性能优于已有的同类算法。
In this paper, a novel genetic algorithm, namely critical path based genetic scheduling algorithm （ CPGS）, was developed for muhiprocessor 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.
出处
《计算机应用》
CSCD
北大核心
2008年第2期272-274,共3页
journal of Computer Applications
关键词
遗传算法
任务调度
关键路径
多处理器系统
genetic algorithm
task scheduling
critical path
muhiprocessor system
