首页 | 本学科首页   官方微博 | 高级检索  
     检索      

异构计算系统中独立任务调度的混合遗传算法
引用本文:钟一文,杨建刚.异构计算系统中独立任务调度的混合遗传算法[J].北京航空航天大学学报,2004,30(11):1080-1083.
作者姓名:钟一文  杨建刚
作者单位:浙江大学 计算机科学与技术学院 杭州 310027
摘    要:有效的任务调度是异构计算系统获取高性能的关键因素之一,由于任务调度问题是NP-困难的,为了获取尽可能好的解,文献中存在许多启发式调度算法.针对异构计算系统的独立任务调度问题,基于遗传算法和最小完成时间算法MCT(Minimum Completion Time),提出一种新的混合遗传算法,它采用遗传算法来进化任务调度的优先队列,然后再使用MCT算法把优先队列解码为一个有效的调度,与文献中其它算法进行比较表明,它不但能产生更好的调度结果,而且有很好的收敛速度. 

关 键 词:独立任务调度    异构计算系统    混合遗传算法    最小完成时间
文章编号:1001-5965(2004)11-1080-04
收稿时间:2004-06-25
修稿时间:2004年6月25日

Hybrid genetic algorithm for independent tasks scheduling in heterogeneous computing systems
Zhong Yiwen,Yang Jiangang.Hybrid genetic algorithm for independent tasks scheduling in heterogeneous computing systems[J].Journal of Beijing University of Aeronautics and Astronautics,2004,30(11):1080-1083.
Authors:Zhong Yiwen  Yang Jiangang
Institution:College of Computer Science and Technology, Zhejiang University, Hangzhou 3100 27, China
Abstract:Efficient tasks scheduling is critical for achieving high performance in heterogeneous computing systems. The tasks scheduling problem is NP-hard in general. In order to obtain better solutions, many scheduling heuristics were presented in the literature. Based on genetic algorithm and MCT(minimum completion time) algorithm, a new hybrid genetic algorithm was presented for independent tasks scheduling in heterogeneous computing systems. Genetic algorithm was used to evolve a priority queue first, and then the priority queue was mapped to a schedule using MCT algorithm. The simulation results comparing with other scheduling algorithm show that it produces better results in terms of schedule length, and it has good convergent speed.
Keywords:independent tasks scheduling  heterogeneous computing systems  hybrid genetic algorithm  minimum completion time
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京航空航天大学学报》浏览原始摘要信息
点击此处可从《北京航空航天大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号