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 κ-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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. J. Berger and S. H. Bokhari. A partitioning strategy for nonuniform problems on multiprocessors. IEEE Trans. Comp., C-36(5), 5 1987.
D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, and T. van Eicken. LogP: Towards a realistic model of parallel computation. In Proc. of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 1–12, 1993.
R. Garmann. Maintaining a dynamic set of geometric objects on parallel processors. Technical Report 646, FB Informatik, Universität Dortmund, D-44221 Dortmund, Germany, ls7-www.cs.uni-dortmund.de, May 1997.
A. Heirich and S. Taylor. A parabolic load balancing method. In Proc. 24th Int. Conf. Par. Proc., volume III, pages 192–202, New York, 1995. CRC Press.
B. Hendrickson, R. Leland, and S. Plimpton. An efficient parallel algorithm for matrix-vector multiplication. Intl. J. High Speed Comput., 7(1):73–88, 1995.
K. Mehlhorn and M. H. Overmars. Optimal dynamization of decomposable searching problems. Information processing letters, 12(2):93–98, April 1981.
A. T. Ogielski and W. Aiello. Sparse matrix computations on parallel processor arrays. SIAM J. Sci. Comput., 14(3):519–530, May 1993.
M. H. Overmars. The Design of Dynamic Data Structures. Lecture Notes in Computer Science; 156. Springer-Verlag, Berlin, 1983.
C.-Z. Xu and F. C. M. Lau. The generalized dimension exchange method for load balancing in k-ary n-cubes and variants. J. Par. Distr. Comp., 24(1):72–85, January 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garmann, R. (1998). Locality preserving load balancing with provably small overhead. In: Ferreira, A., Rolim, J., Simon, H., Teng, SH. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1998. Lecture Notes in Computer Science, vol 1457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018529
Download citation
DOI: https://doi.org/10.1007/BFb0018529
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64809-3
Online ISBN: 978-3-540-68533-3
eBook Packages: Springer Book Archive