网格环境下的可分割算法的改进

摘要

Based on Uniform Multi-Round (UMR) scheduling algorithm:the job execution time don't reduce with the assigned node increasing.In the Grid environment,this paper advances the optimization UMR scheduling algorithm:For the specified job,reasonable allocation of the number of resource nodes,rather than all the use of the resource nodes.This makes the resource nodes to use the minimum,meantime reducing the execution of the job time.The experimental results show the algorithm takes advantage of grid resources and improves the efficiency of the job.%针对统一多路调度(Uniform Multi-Round,UMR)算法存在的问题,作业的执行时间并不是随着工作节点个数增加而减少,提出在网格环境下,最优UMR调度算法:对指定的作业,合理分配资源节点个数,而不是对资源节点的全部使用,使资源节点数利用最小的情况下,作业的执行时间最短.实验结果表明,该算法充分利用了网格资源,提高了作业的执行效率.