Abstract
An important characteristic of distributed grids is that they allow geographically separated multicomputers to be tied together in a transparent virtual environment to solve large-scale computational problems. However, many of these applications require effective runtime load balancing for the resulting solutions to be viable. This paper compares the performance of our MinEX latency-tolerant partitioner with METIS using simulated heterogeneous grid configurations. A solver for the classical N-body problem is implemented to provide a framework for the comparisons. Experimental results show that MinEX provides superior quality partitions and is competitive to METIS in execution speed.
Partially supported by NASA Ames under Cooperative Agreement NCC 2-5395.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Barnes and P. Hut, “A hierarchical O(N log N) force calculation algorithm,” Nature, 324 (1986) 446–449.
G. Cybenko, “Dynamic load balancing for distributed-memory multiprocessors,” Journal of Parallel and Distributed Computing, 7 (1989) 279–301.
S.K. Das, D.J. Harvey, and R. Biswas, “MinEX: A latency-tolerant dynamic partitioner for grid computing applications,” Future Generation Computer Systems, 18 (2002) 477–489.
I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, 1999.
Globus Project, See URL http://www.globus.org .
B. Hendrickson and R. Leland, “A multilevel algorithm for partitioning graphs,” Technical Report SAND93-1301, Sandia National Laboratories, 1993.
G. Karypis and V. Kumar, “Parallel multilevel k-way partitioning scheme for irregular graphs,” Technical Report 96-036, University of Minnesota, 1996.
S. Kumar, S.K. Das and R. Biswas, “Graph partitioning for parallel applications in heterogeneous grid environments,” 16th International Parallel and Distributed Processing Symposium, 2002.
L. Oliker and R. Biswas, “Parallelization of a dynamic unstructured algorithm using three leading programming paradigms,” IEEE Transactions on Parallel and Distributed Systems, 11 (2000) 931–940.
H. Shan, J.P. Singh, L. Oliker, and R. Biswas, “A comparison of three programming models for adaptive applications on the Origin2000,” Journal of Parallel and Distributed Computing, 62 (2002) 241–266.
H. Shan, J.P. Singh, L. Oliker, and R. Biswas, “Message passing and shared address space parallelism on an SMP cluster,” Parallel Computing, 29 (2003) 167–186.
J.P. Singh, C. Holt, T. Totsuka, A. Gupta, and J. Hennessy, “Load balancing and data locality in adaptive hierarchical N-body methods: Barnes-Hut, fast multipole, and radiosity,” Journal of Parallel and Distributed Computing, 27 (1995) 118–141.
C. Walshaw, M. Cross, and M. Everett, “Parallel dynamic graph partitioning for adaptive unstructured meshes,” Journal of Parallel and Distributed Computing, 47 (1997) 102–108.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harvey, D.J., Das, S.K., Biswas, R. (2003). Designing an Efficient Partitioning Algorithm for Grid Environments with Application to N-body Problems. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44843-8_30
Download citation
DOI: https://doi.org/10.1007/3-540-44843-8_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40161-2
Online ISBN: 978-3-540-44843-3
eBook Packages: Springer Book Archive