By Topic

Exploiting inter task dependencies for dynamic load balancing

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)
Becker, W. ; Inst. for Parallel & Distributed High Performance Syst., Stuttgart Univ., Germany ; Waldmann, G.

The major goal of dynamic load balancing is not primarily to equalize the load on the nodes of a parallel computing system, but to optimize the average response time of single requests or the throughput of all applications in the system. Therefore it is often necessary not only to keep all processors busy and all processor ready queue lengths within the same range, but to avoid delays and inefficient computations caused by foreseeable but ignored data flow and precedence constraints between related tasks. We present concepts for dynamic consideration of inter task dependencies within small groups of tasks and evaluate them observing real applications in a load balancing environment on a network of workstations. The concepts are developed from scheduling of single task graphs towards heterogeneous multi user operation scenarios

Published in:

High Performance Distributed Computing, 1994., Proceedings of the Third IEEE International Symposium on

Date of Conference:

2-5 Aug 1994