Designing an Efficient Partitioning Algorithm for Grid Environments with Application to N-body Problems
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.
KeywordsCommunication Cost Grid Environment Partition Graph Partitioning Algorithm Application Runtimes
Unable to display preview. Download preview PDF.
- 4.I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, 1999.Google Scholar
- 5.Globus Project, See URL http://www.globus.org.
- 6.B. Hendrickson and R. Leland, “A multilevel algorithm for partitioning graphs,” Technical Report SAND93-1301, Sandia National Laboratories, 1993.Google Scholar
- 7.G. Karypis and V. Kumar, “Parallel multilevel k-way partitioning scheme for irregular graphs,” Technical Report 96-036, University of Minnesota, 1996.Google Scholar
- 8.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.Google Scholar