By Topic

Performance Analysis of Task Scheduling Heuristics in Grid

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Munir, E.U. ; Harbin Inst. of Technol., Harbin ; Jian-Zhong Li ; Sheng-Fei Shi ; Rasool, Q.

Reduction in makespan is one of the fundamental objectives of optimizing task scheduling problems in distributed heterogeneous computing systems. In this paper, we present a performance based comparative analysis among different scheduling heuristics for independent task scheduling in Grid. Several existing heuristics were simulated and existing Sufferage algorithm was improved by introduction of Quality of Service (QoS) parameter. Experimental results reveal that there exist certain circumstances where one scheduling technique can outperform others. It is also observed that the Sufferage with QoS does perform well as compared with other heuristics.

Published in:

Machine Learning and Cybernetics, 2007 International Conference on  (Volume:6 )

Date of Conference:

19-22 Aug. 2007