A Selective Algorithm Based on Multiple QoS Constraints for Grid Task Scheduling

In computational grid environments, QoS guided scheduling problem, especially when the task has multiple QoS demands, is complex and challenging. AQoS guided scheduling heuristic algorithm for a set of independent tasks has been presented. In this paper we introduce a new selective algorithm based on multiple QoS constraints for grid task scheduling. The experiments show that the algorithm not only considers the multiple QoS constraints, but also has better performance and load balance than the QoS guided Min-Min algorithm.