A dependent tasks scheduling model in grid

Abstract

In Grid computing, an application will be decomposed into a set of dependent tasks. In the Grid environment where resources have different capability and resources are interconnected over the world, the dependence among tasks affects the scheduling strategy greatly. This paper uses a Task-Resource Assignment Graph (T-RAG) to represent a potential resource assignment plan. And a dependent tasks scheduling model based on Best Task-Resource Assignment Graph (BT-RAG) construction is proposed which maps the dependent tasks scheduling problem into a graph construction problem. The BT-RAG is obtained and such graph is the optimal scheduling plan which determines the resource assignment plan and the execution order of tasks. Finally, the task scheduling algorithm based on the proposed scheduling model is implemented. Compared with HEFT algorithm, the proposed algorithm shows better performance in the situation of a large body of data transported among tasks. © 2008 Springer-Verlag Berlin Heidelberg.