ABSTRACT

Processor heterogeneity is an important issue in grid environment. In this paper, a list based task scheduling algorithm, called “critical path scheduling with t-level” (CPST) for grid computing system is proposed. There are no. of scheduling algorithms such as HEFT [1] use mean execution time based b-level for task priority and SHCP [2] use task priority based on simple critical path. In CPST, a critical path based task sequence is generated with t-level value of tasks, where variance based computation and communication cost is used. The experimental results show that CPST algorithm performs better than HEFT, SHCP and HHS algorithm in grid environment for task graphs.