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.

[1]  Kobra Etminani,et al.  A Min-Min Max-Min Selective Algorithm for Grid Task Scheduling , 2007, 2007 3rd IEEE/IFIP International Conference in Central Asia on Internet.

[2]  Fan Xiao-zhong.  Grid Scheduling Simulations Based on GridSim , 2006 .

[3]  R. F. Freund,et al.  Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[4]  Gregor von Laszewski,et al.  QoS guided Min-Min heuristic for grid task scheduling , 2003, Journal of Computer Science and Technology.

[5]  Selim G. Akl,et al.  Scheduling Algorithms for Grid Computing: State of the Art and Open Problems , 2006 .