A multi-QoS guaranteed dynamic grid resource scheduling algorithm

This paper presents a Quality of Service (QoS) guaranteed dynamic grid resource scheduling algorithm. It mainly deals with multiple QoS-based grid resource scheduling models and solves the scheduling problems using optimization techniques. The paper proposes the idea of decomposing a global optimization problem in multiple QoS-based resource scheduling into two sub-problems, which simplifies the problem and makes it mathematically tractable. An iterative algorithm is also presented to get grid users and grid resource providers to interact with each other in an interactive process in resource market and achieve optimal QoS constraint dynamic grid resource scheduling. The paper provides performance studies comparing the proposed optimal approach with three possible easier approaches, which provide only partial optimization. The experimental results show that the proposed approach considering both computation and network traffic is able to better optimize the execution time than approaches, which consider only one or none of these criteria.