A dependent tasks scheduling model in grid

Authors:
Tingwei Chen;Bin Zhang;Xianwen Hao
Affiliations:
College of Information Science and Technology, Liaoning University, P.R. China;College of Information Science and Engineering, Northeastern University, P.R. China;College of Information Science and Engineering, Northeastern University, P.R. China
Venue:
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Year:
2008

Citing 10
Cited 1

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
A comparison of list schedules for parallel processing systems

Communications of the ACM
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
Guest Editor's Introduction: Heterogeneous Processing

Computer
Grain Size Determination for Parallel Processing

IEEE Software
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
A Metascheduler For The Grid

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Designing and evaluating an active grid architecture

Future Generation Computer Systems - Special issue: Advanced grid technologies
The Iso-level scheduling heuristic for heterogeneous processors

EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing

Dynamic Dependent Tasks Assignment for Grid Computing

International Journal of Grid and High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

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.