网格环境下改进的独立任务调度遗传算法  

Improved genetic algorithm for independent tasks scheduling in grid

作　　者：黄德才[1] 钟艳平[1] 

机构地区：[1]浙江工业大学信息工程学院,杭州310032

出　　处：《计算机工程与应用》2007年第26期138-141,共4页Computer Engineering and Applications

基　　金：浙江省自然科学基金( the Natural Science Foundation of Zhejiang Province of China under Grant NoY105118; NoY105109)

摘　　要：针对网格环境下独立任务的调度问题,提出了一种新的混合遗传算法,通过调整算法结构,来增加染色体的多样性,通过加入针对特定问题的调整操作,来有效地提高算法的局部搜索能力,使遗传算法兼具全局和局部搜索能力,防止早熟收敛。仿真实验表明,跟其他算法相比,提出的算法取得了很好的调度长度,并且收敛速度也很快。Presents a new hybrid genetic algorithm to solve the problem of independent tasks scheduling in grid.This algorithm expands the variety of population by adjusting the structure of the algorithm,and it also improves the local search ability by adding the adjusting operation.It has good global and local search ability,which can avoid premature convergence.The simulation results comparing with other scheduling algorithms show that it produces better results in terms of schedule length and it also has good convergent speed.

关 键 词：网格 任务调度 遗传算法 局部搜索 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]