一种基于参数扫描应用容错的粗粒度网格调度算法

A fault tolerant grid scheduling algorithm for coarse-grained tasks based on parameter sweep applications

考虑作业处理时延以及作业传输时延对调度器性能的影响,在RR调度算法的基础上提出了一种新的基于参数扫描应用的调度算法PRR,并对该算法进行了理论分析,得出了该调度算法不需要作业以及处理器的相关信息,且具有比较好的容错性的结论.利用网格仿真软件Gridsim对PRR调度算法的理论分析结果进行了验证,并将该算法与RR调度算法的性能进行了比较.结果表明,当时延较大时,PRR调度算法性能改善比较明显.

Considering the effect of delay in task submitting and data transferring on scheduler performance, a new scheduling algorithm PRR based on parameter sweep application was presented based on RR scheduling algorithm. The theoretical analysis shows that the new algorithm has high fault tolerance and does not need the related information of tasks and processors. With the simulation software Gridsim, the theoretical result of the PRR scheduling algorithm was verified, and the performance of the new scheduling algorithm at long delay was obviously improved as compared with that of the scheduling algorithm RR.