DAG Cluster Scheduling Algorithm for Grid Computing

During the tasks scheduling In Grid, communication delay plays an important role in Grid scheduling, which not only leads to waiting between tasks, but also results in much idle interval time between processing units. At the same time, how to make use of resources and how to select resources are also important factors. In this paper, combining the list scheduling with the task duplication scheduling scheme, a new DAG (Directed Acyclic Graph) cluster algorithm called CFTD (Cluster Earliest Finish Time Duplication) for heterogeneous Grid systems is presented. CFTD attempts to insert suitable immediate parent nodes of the current selected node in order to reduce its waiting time on the processor. The case study and experimental results show that the algorithm proposed in this paper is better than HEFT algorithm.