Paper Info
Title
DAGMap: efficient and dependable scheduling of DAG workflow job in Grid
Abstract
DAG has been extensively used in Grid workflow modeling. Since Grid resources tend to be heterogeneous and dynamic, efficient and dependable workflow job scheduling becomes essential. It poses great challenges to achieve minimum job accomplishing time and high resource utilization efficiency, while providing fault tolerance. Based on list scheduling and group scheduling, in this paper, we propose a novel scheduling heuristic called DAGMap. DAGMap consists of two phases, namely Static Mapping and Dependable Execution. Four salient features of DAGMap are: (1) Task grouping is based on dependency relationships and task upward priority; (2) Critical tasks are scheduled first; (3) Min-Min and Max-Min selective scheduling are used for independent tasks; and (4) Checkpoint server with cooperative checkpointing is designed for dependable execution. The experimental results show that DAGMap can achieve better performance than other previous algorithms in terms of speedup, efficiency, and dependability.
Year
DOI
Venue
2010
10.1007/s11227-009-0284-7
The Journal of Supercomputing
Keywords
Field
DocType
dependable scheduling,dependable workflow job scheduling,list scheduling,group scheduling,novel scheduling heuristic,dependable execution,dag workflow job,dag grid workflow · critical task · adaptive scheduling · cooperative checkpointing,high resource utilization efficiency,critical task,grid workflow modeling,grid resource,max-min selective scheduling,resource utilization,job scheduling,fault tolerant
Dependability,Computer science,Scheduling (computing),Parallel computing,Fault tolerance,Resource allocation,Job scheduler,Workflow,Grid,Distributed computing,Speedup
Journal
Volume
Issue
ISSN
51
2
1573-0484
Citations 
PageRank 
References 
14
0.66
17
Authors
5
Name
Order
Citations
PageRank
Haijun Cao1929.51
Hai Jin26544644.63
Xiaoxin Wu347538.35
Song Wu455158.06
Xuanhua Shi557157.87