ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Journal of Parallel and Distributed Computing
Volume 60, Issue 9, September 2000, Pages 1047-1073
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (263 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1006/jpdc.2000.1647    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2000 Academic Press. All rights reserved.

Regular Article

Parallel Load Balancing for Problems with Good Bisectors*1

Stefan Bischofa, Ralf Ebnerb and Thomas Erlebachc

SSA SoftSolutions GmbH, Bauernfeld 4a, D-86165, Augsburg, Germanyf1 Leibniz-Rechenzentrum der Bayerischen Akademie der Wissenschaften, Barer Straße 21, D-80333, München, Germany, f2 Computer Engineering and Networks Laboratory, ETH Zürich, Gloriastrasse 35, CH-8092, Zürich, Switzerland, f3

Received 13 July 1999; 
revised 11 April 2000; 
accepted 12 April 2000. ;
Available online 25 March 2002.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Parallel load balancing is studied for problems with certain bisection properties. A class of problems has α-bisectors if every problem p of weight Image (p) 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 Image (p)/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 O(log N) and provide constant upper bounds on the worst-case load imbalance. Results of simulation experiments regarding the load balance achieved in the average case are presented.


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.