Sciweavers

Share
IPPS
1999
IEEE

Parallel Load Balancing for Problems with Good Bisectors

9 years 6 months ago
Parallel Load Balancing for Problems with Good Bisectors
Parallel load balancing is studied for problems with certain bisection properties. A class of problems has bisectors if every problem p of weight wp in the class can be subdivided into two subproblems whose weight (load) is at least an -fraction of the original problem. A problem p is to be split into N subproblems such that the maximum weight among them is as close to wp=N as possible. It was previously known that good load balancing can be achieved for such classes of problems using Algorithm HF, a sequential algorithm that repeatedly bisects the subproblem with maximum weight. Several parallel variants of Algorithm HF are introduced and analyzed with respect to worst-case load imbalance, running-time, and communication overhead. For fixed , all variants have running-time OlogN and provide constant upper bounds on the worstcase load imbalance. Results of simulation experiments regarding the load balance achieved in the average case are presented.
Stefan Bischof, Ralf Ebner, Thomas Erlebach
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where IPPS
Authors Stefan Bischof, Ralf Ebner, Thomas Erlebach
Comments (0)
books