Locality Preserving Load Balancing With Provably Small Overhead
switch to german Deutsche Version

Robert Garmann:
Locality Preserving Load Balancing With Provably Small Overhead,
IRREGULAR '98. 5th International Symposium on Solving Irregularly Structured Problems in Parallel, August 9-11 1998, Berkeley, California, LNCS 1457. Springer, 1998.

Abstract: Parallelizing dynamic scientific applications involves solving the dynamic load balancing problem. The balancing should take the communication requirements of the application into account. Many problems are dealing with objects in k-dimensional space with very special communication patterns. We describe a kind of an orthogonal recursive bisection clustering and show that its dynamic adaption involves only small overhead. As a spatial clustering it is well suited to applications with local communication.

Text: pdf
Robert Garmann, June 10, 2007