By Topic

Comparison of contention aware list scheduling heuristics for cluster computing

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)
Sinnen, O. ; IST/INESC-ID, Univ. Tecnica de Lisboa, Lisboa, Portugal ; Sousa, L.

In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a Directed Acyclic Graph (DAG) to a target machine. As most heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the inter communication links. This article extends the list scheduling heuristic for contention aware scheduling on heterogenous arbitrary machines. The extension is based on the idea of scheduling edges to links, likewise the scheduling of nodes to processors. Based on this extension, we compare eight priority schemes for the node order determination of the first phase of list scheduling. Random graphs are generated and scheduled with the different schemes to homogenous and heterogenous parallel systems from the area of cluster computing. The experiments demonstrate the appropriateness of our extended list scheduling for homogeneous and heterogenous cluster architectures

Published in:

Parallel Processing Workshops, 2001. International Conference on

Date of Conference: