By Topic

DAGMap: Efficient scheduling for DAG grid workflow job

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Haijun Cao ; Services Comput. Technol. & Syst. Lab., Huazhong Univ. of Sci. & Technol., Wuhan ; Hai Jin ; Xiaoxin Wu ; Song Wu
more authors

DAG has been extensively used in grid workflow modeling. Since the computational capacity of available grid resources tends to be heterogeneous, efficient and effective workflow job scheduling becomes essential. It poses great challenges to achieve minimum job accomplishing time while maintaining high grid resources utilization efficiency. Based on list scheduling and group scheduling, in this paper we propose a novel static scheduling heuristic, called DAGMap. DAGMap consists of three phases, namely prioritizing, grouping, and independent task scheduling. Three salient features of DAGMap are 1) Task grouping is based on dependency relationships and task upward priority; 2) Critical tasks are scheduled first; and 3) Min-Min and Max-Min selective scheduling are used for independent tasks. The experimental results show that DAGMap can achieve better performance than other previous algorithms in terms of makespan, speedup, and efficiency.

Published in:

Grid Computing, 2008 9th IEEE/ACM International Conference on

Date of Conference:

Sept. 29 2008-Oct. 1 2008