Performance Analysis of Task Scheduling Heuristics in Grid

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.