An efficient list scheduling algorithm of dependent task in grid

In this paper, an efficient scheduling algorithm based on critical path suitable for dependent tasks (DAG scheduling) in grid computing has been presented. With the object to shorten the makespan greatly, a new approach for constructing the task list has been developed, and an efficient processor selection procedure has also been developed.