摘要
任务分配问题是公认的NP难问题。文章在以往有关多处理机任务分配算法的基础上,提出了一种适用于SMP系统结构的并行遗传调度算法。仿真结果表明,该算法具有较好的效果和收敛性。
In general the tasks scheduling problem is a NP-hard problem. Based on the algorithms related with multiprocessor scheduling problem, this paper presents a parallelism genetic scheduling algorithm which well-adapted to the SMP system architecture. Simulation results comparing with other two genetic algorithms, both from the Literatures, show that our algorithm produces encouraging results in terms of quality of solutions and execution speed and even has more advantages in convergence.
出处
《微电子学与计算机》
CSCD
北大核心
2006年第6期181-184,共4页
Microelectronics & Computer
关键词
任务分配与调度
并行遗传算法
SMP
Task matching and scheduling, Parallel genetic algorithm, SMP
