By Topic

Scalable scheduling algorithm for distributed memory machines

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
$33 $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)
S. Darbha ; Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA ; D. P. Agrawal

The problem of scheduling tasks onto distributed memory machines for obtaining an optimal schedule is an NP-complete problem. We present a scalable scheduling algorithm which can schedule the tasks of directed acyclic graphs (DAGs) with a complexity of O(V2) in the worst case, where V is the number of nodes of the DAG. This algorithm generates an optimal schedule for a class of DAGs which satisfy certain conditions and if the required number of processors are available. The algorithm initially generates a schedule for a small number of processors. In case the available number of processors are higher than the number of processors required by the initial schedule, the algorithm scales the schedule appropriately in an effort to obtain a lower parallel time by utilizing the extra or idle processors. The algorithm has been applied to some practical DAGs and the results are very promising

Published in:

Parallel and Distributed Processing, 1996., Eighth IEEE Symposium on

Date of Conference:

23-26 Oct 1996