一种改进的启发式网格任务调度算法  

An Improved Heuristic Algorithm for Tasks Scheduling on Grid Computing

作　　者：崔玉宝[1] 李建义[1] 薛桂香[2] 

机构地区：[1]北华航天工业学院计算机系 [2]天津大学电子信息工程学院

出　　处：《微型电脑应用》2006年第5期6-7,39,共3页Microcomputer Applications

摘　　要：网格任务调度算法是影响网格成功与否的关键技术之一。网格计算中,一个好的任务调度算法不但要考虑所有任务的makespan,使其值尽量小,同样要考虑到整个系统机器间的负载平衡问题。文章对异构计算环境下的元任务调度算法进行了分析,针对Min-min算法可能引发的负载不平衡问题,结合网格计算环境的特点,提出了一种适用于网格计算环境中的任务调度算法。Algorithm for Grid Tasks Scheduling is one of the key technologies which influence Grid success. Grid system is composed of heterogeneous resources. In grid computing, a good algorithm for tasks scheduling should not only decrease the makespan of all tasks but also balance the load among the resources in the grid system. We first analyze the scheduling of meta-tasks in the heterogeneous environment, and then according to the load imbalance question in the Min-min algorithm, propose an improved algorithm that suits to be used in the grid environment.

关 键 词：网格 任务调度 算法 完成时间 

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