Grid Task Scheduling Algorithms And Model Based On QoS Constraint And Cost Restriction

In recent years, grid platform is developed by maturity of the network technology. Grid computing is that the scattered groups link through the network and make the scattered computing resource to be effective integrated and applied. Grid system needs to have a good scheduling strategy. Along with the extension of grid study, the QoS of users and the total cost are research attraction in the grid task scheduling area.This paper proposed two unitary approach of simplified parameters, for the timeliness, reliability, and safety factors in the grid, based on the quota and the qualitative of QoS parameter, showed the concrete evaluation function and the comprehensive evaluation function by studying the QoS parameter model of grid environments. We analyzed the classic Max-Min algorithm, considered the effect of QoS for grid task scheduling. A makespan oriented scheduling algorithm (MOS) is described with the evaluation function of QoS, the object is that the QoS of users can be assured and the makespan, also called schedule length, of a task application can be minimized. In addition, I proposed another grid task scheduling algorithm, also called cost oriented scheduling (COS), based on the restriction of total cost, improved on the MOS algorithm with the market economic model and the cost adjustment factor, the object is that the QoS of users can be assured and total cost can be optimized. In the last part of my treatise, I carry out series of emulation on the improved scheduling algorithm. The result of emulation indicates that the improved scheduling algorithm has better function and satisfies the different needs of users on QoS.