改进遗传算法的并行任务调度  

Parallel task scheduling algorithm using improved genetic algorithm

作　　者：袁雪莉[1] 钟明洋[2] 

机构地区：[1]重庆医科大学附属第一医院网络信息中心,重庆400016 [2]重庆大学软件学院,重庆400044

出　　处：《计算机工程与应用》2011年第10期56-59,共4页Computer Engineering and Applications

基　　金：国家"十一五"科技支撑计划No.2006BAH02A20~~

摘　　要：并行任务调度是一个NP完全问题,它关注资源的分配和并行任务调度,要求具有高性能的调度算法,且能求解出高质量的解。提出了一种基于改进遗传算法的并行任务调度算法,在算法初始化种群产生时引入任务向量矩阵来表示任务、资源以及调度的关系,并采用启发式方法得到初始化种群,提高种群质量;采用规则约束的交叉和变异操作,提高个体的质量;提出了加速进化策略,有效地避免了早熟。仿真实验结果表明,该改进算法能更有效地求解并行任务调度问题。Parallel task scheduling is NP-complete problem,which focuses on resource allocation and parallel task schedule, requiring high-performance scheduling algorithm and high-quality solutions.The paper presents a parallel task scheduling algorithm based on improved genetic algorithm,which introduces vector matrix to represent task,resource and scheduling relationship,and use heuristics when original colony is initialized,improving the quality of initial colony.And it adopts rule-bound crossover and mutation operation to improve individual quality.Besides,it proposes an evolution acceleration strategy to avoid the premature effectively.Simulation result suggests that the algorithm can solve the parallel task scheduling problems effectively.

关 键 词：遗传算法 并行任务调度 任务向量矩阵 加速进化策略 

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