By Topic

Dynamic load balancing with an improved with an improved spectral bisection algorithm

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)
Van Driessche, R. ; Dept. of Comput. Sci., Katholieke Univ., Leuven, Belgium ; Roose, D.

The efficient parallel execution of grid-oriented scientific calculations requires the partitioning of the grid in such a way that the work load is equally distributed over the processors of the parallel machine and that communication among the processors is minimized. For unstructured static grids, good partitions are obtained by applying the recursive spectral bisection heuristic to the interdependency graph of the grid. We describe how even in case of dynamically changing grids, grid-oriented problems can be formulated as graph partitioning problems for the purpose of load balancing. We further describe an alternative spectral bisection algorithm that yields better partitions than the standard algorithm for the graphs that model dynamic load balancing problems

Published in:

Scalable High-Performance Computing Conference, 1994., Proceedings of the

Date of Conference:

23-25 May 1994