By Topic

Heterogeneity-Aware Task Scheduling Using Critical Path in Grid Environments

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

2 Author(s)
Agarwal, A. ; Dept. of Electron. & Comput. Eng., Indian Inst. of Technol. Roorkee, Roorkee, India ; Kumar, P.

Heterogeneity of resources can not be ignored while scheduling application task graphs in grid environment. In this paper, a list-based task scheduling algorithm, called scheduling with heterogeneity using critical path (SHCP) for grid computing system is presented. Some other scheduling algorithms such as HEFT use mean execution time based b-level for deciding task priority and ignore the importance of critical path. In SHCP, a critical path based task sequence is generated where variance based computation and communication costs are used. The experimental results show that SHCP algorithm performs better than HEFT and HHS algorithms in grid environment for large task graphs and at high CCRs.

Published in:

2009 International Conference on Signal Processing Systems

Date of Conference:

15-17 May 2009