Abstract
We present a tool for balanced decomposition of spatial domains. In addition to applying a nested bisection algorithm to determine the boundaries of each subdomain, the tool replicates a user specified zone along the boundaries of the subdomain in order to minimize future interactions between subdomains. Results of running the tool on the Cray T3D system, as well as using it in the implementation of a parallel Particle-particle/Particle-Mesh code are reported and discussed.
This work is in part supported by an NSF Grand Challenge grant ASC-9318185
Preview
Unable to display preview. Download preview PDF.
References
Balsara, D.S. and Brandt, A., “Multilevel Methods for Fast Solution of N-Body and Hybrid Systems”, Int. Ser. Num. Math, 98, 131. 1991.
Bokhari, S.H., “Assignment problems in Parallel and Distributed Computing”, Kluwer Academic Publishers, 1981.
Fox, G., Johnson, M., Lyzenga, G., Otto, S., Salmon, J., and Walker, D. “Solving Problems on Concurrent Processors”. Prentice-Hall, 1988.
R.W.Hockney and J.W. Eastwood, “Computer Simulation Using Particles.” New York: Mcgraw Hill International, 1981.
Warren, M.S. and Salmon, J.K “A Parallel Hashed Oct-tree N-body Algorithm”. In Supercomputing '93, PP. 12–21, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yuan, X., He, B., Balsara, D., Melhem, R. (1996). A load balancing package for domain decomposition on distributed memory systems. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_595
Download citation
DOI: https://doi.org/10.1007/3-540-61142-8_595
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61142-4
Online ISBN: 978-3-540-49955-8
eBook Packages: Springer Book Archive