排队时间感知的动态网格工作流调度

A Queuing Time Aware Dynamic Grid Workflow Scheduling Algorithm

网格资源站点的可靠性将影响站点上任务执行性能,从而影响其他任务的排队等待时间.利用可修排队系统对网格资源站点进行可靠性建模,通过模型求解获得稳态下各资源站点的排队等待时间,提出了排队时间感知的动态网格工作流调度算法并设计了动态网格工作流调度的原型系统.基于GridSim进行了不同网格系统环境设置场景下的仿真实验.实验结果表明,本算法在不同负载和不同失效率的情况下其完成时间明显优于HEFT和CPOP算法,且在平均等待时间方面也比这2种算法高出了50%左右.

The reliability of a Grid resource site will affect the execution performance of tasks on the site,which will bring effect on the queuing time of other tasks on this site.Repairable queuing system was used to describe the reliability of Grid resource sites,and the queuing time of each site in steady-state could be obtained by solving this model.A queuing time aware dynamic Grid workflow scheduling（QTADGWS） algorithm was proposed,and the corresponding dynamic Grid workflow scheduling system was designed.A lot of simulation experiments in different scenarios with different parameter setups have been done based on GridSim.The experimental results indicated that QTADGWS could achieve better performance on makespan and average waiting time than HEFT and CPOP algorithms.