基于资源有效性分级的网格任务调度算法  

Grid Task Scheduling Algorithm Based on Grading of Validity of Resources

作　　者：钟景秀[1] 李春林[1] 施步青[1] 

机构地区：[1]武汉理工大学计算机科学与技术学院,武汉430063

出　　处：《武汉理工大学学报》2009年第3期59-61,69,共4页Journal of Wuhan University of Technology

基　　金：国家自然科学基金(60773211)

摘　　要：为解决网格环境下有多QoS约束的任务调度问题,对异构环境下网格资源相对于任务的有效性进行分析,提出了资源有效性的概念,并根据有效资源的数量对所有任务分级,提出了一种分级约束下的网格任务调度算法GC-Min-Min。最后,通过一个网格任务调度仿真实验,考察了不同的有效资源比例对任务调度的影响,并将新算法与Min-Min算法进行了对比。实验结果表明,该算法有较小的任务完成时间,更适用于有多QoS约束下网格任务的调度。In order to solve the problem of multi-QoS constrained task scheduling in grid environment, a concept of ＇ validity of resources＇ is proposed based on the analysis of the validity of resources for a task in the heterogeneous environment. Furthermore, tasks graded according to the number of valid resources, and a grade-constrained task-scheduling algorithm GC-Min-Min is proposed. Finally, an experiment is designed to study the effect caused by different rate of the valid resources, and compares the novel algorithm to the Min-Min algorithm. As the results show, the algorithm turns out to be more adapting to the multi- QoS constrained task scheduling due to the less makespan.

关 键 词：QOS 任务调度 MAKESPAN 资源有效性 

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