By Topic

Effect of variation in compile time costs on scheduling tasks on distributed memory systems

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)
Darbha, S. ; Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA ; Santosh Pande

One of the major limitations of compile time scheduling schemes is the inability to precisely determine the computation and communication costs prior to generating the schedule. The authors address the issue of sensitivity of a given scheduling algorithm to the variations in imprecisely known compile time costs. The variations in the compile time costs can affect in one of the two ways: (i) original schedule found by the algorithm using estimated compile time costs does not change (schedule is invariant), or (ii) original schedule found by the algorithm changes when the costs change. For the first scenario, they have derived the conditions under which the schedule found by our algorithm would be invariant. For those cases where the schedule length changes, they have also introduced a measure of sensitivity of the schedule or the scheduling algorithm, defined as the ratio of percentage change in schedule length to that of maximum allowable percentage change in a node computation cost or an edge communication cost. Through an experimental study they show that the proposed algorithm is extremely insensitive and can be used in practical scheduling situations, where the compile time costs are known imprecisely

Published in:

Frontiers of Massively Parallel Computing, 1996. Proceedings Frontiers '96., Sixth Symposium on the

Date of Conference:

27-31 Oct 1996