By Topic

Dynamic load balancing of iterative data parallel problems on a workstation cluster

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

5 Author(s)
Hye-Seon Maeng ; Parallel Process Syst. Lab., Yonsei Univ., Seoul, South Korea ; Hyoun-Su Lee ; Tack-Don Han ; Sung-Bong Yang
more authors

Dynamic load balancing of the workloads of clustered workstations has emerged as a powerful solution for overcoming load imbalance. In order to detect such imbalances, some load balancing methods check the average idle-time of the workstations periodically. But in these methods load balancing cannot be performed until the end of a period even if load imbalance has occurred in the middle of the period. In this paper, we present a new threshold load balancing method for workstations which process the jobs with relatively long execution times. The new method decides a proper time to perform load balancing and does perform the balancing right after the detection of the load imbalance. We also show that a static load balancing method with a long period is suitable if the workstations have to deal with the jobs having unpredictable arrival times and relatively short execution times. The performance of the methods presented in this paper is compared with the method without load balancing as well as with the periodic methods in (Siegell and Steenkiste, 1994), (Nedeljkovic and Quinn, 1992) and (Schnekenburger and Huber, 1994). The experiments were done with an iterative data parallel problem called the ISING problem (Saltz et al., 1995). The experimental results show that our methods outperform all the other methods that we compared

Published in:

High Performance Computing on the Information Superhighway, 1997. HPC Asia '97

Date of Conference:

28 Apr-2 May 1997