Scheduling Algorithm in Grids Based on Benefit
基于效益函数的网格任务调度算法

Scheduling grid tasks onto the dynamic, heterogeneous and widely distributed grid environments is a complex and challenging task. According to dynamic characteristic in grids, especial for the dynamic QoS request by the users, a scheduling algorithm based on benefit is present in this paper. Running the algorithm onto the simulator GridSim and comparing it to the algorithm based on deadline and the algorithm based on budget implies that the algorithm based on benefit take advantageous over the two algorithms of the simulator in some degree. Because of adapting to the dynamic request of QoS by the users, the algorithm not only achieves better performance in budget than the algorithm based on deadline when they finished the number of gridlets is same and spent equal deadline, but also in deadline than the algorithm based on budget on the assumption that they finished the same set of gridlets and consumed the equal quantity of budget.