基于免疫原理的网格任务调度算法  

Schedule Algorithm for Grid Task Based on Immune Principles

作　　者：吴成茂[1] 

机构地区：[1]西昌学院信息技术系,四川西昌615013

出　　处：《计算机工程》2011年第1期164-166,共3页Computer Engineering

摘　　要：针对网格资源管理的任务调度问题,提出一种网格任务免疫调度算法。算法遵循克隆选择、亲和度成熟2个免疫原理,求解网格任务调度问题的全局最优解。讨论种群代数设置和算法参数的设置对该算法性能的影响。仿真实验结果表明,与传统的网格任务调度算法相比,该算法具有任务调度速度快、资源分配时间短、运行稳定等优点。To address the task schedule problem in grid resomce management, an itrmmnity schedule algorithm for grid task is put forward, The algorithm abides by the immune principles of clonal selection and affinity maturation, and seeks the all-around excellent result to the schedule problem for grid task. The settings of group generation and parameters of the algorithm are discussed, which can influence the performance of the algorithm. Experimental results of simulation demonstrate that the algorithm, compared with the conventional algorithm of grid task schedule, has the virtues of rapid task schedule, short-time resource allocation and steady function.

关 键 词：网格 人工免疫 任务调度 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]