改进型蚁群算法的多处理机任务调度研究  

Research of multiprocessors scheduling policy based on improved ant colony algorithm

作　　者：张勇[1] 张曦煌[1] 

机构地区：[1]江南大学信息工程学院,江苏无锡214122

出　　处：《计算机工程与应用》2007年第35期74-76,共3页Computer Engineering and Applications

摘　　要：蚁群算法是一种新型的模拟进化算法,具有正反馈、分布式计算等特点,是一种解决组合优化问题的有效算法。在介绍蚁群算法基本原理以及探讨该算法的缺陷基础上,针对多处理器任务调度问题,提出了一种基于改进型蚁群算法的调度策略。仿真研究表明,该算法具有优良的全局优化性能,效果令人满意。Ant Colony Algorithm （ACA） is a novel simulated evolutionary algorithm with the characteristic of positive feedback and distributed computation,it is also a neffective algorithm to solve combinatorial problems.After the basic theory of ACA is introduced,a multiprocessors scheduling policy based on an improved ant colony algorithm is proposed in this paper.The simulation results show that the ACA has excellent global optimization properties,and the effect of simulation is satisfactory.

关 键 词：蚁群算法 多处理器 调度 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]