Designing an Efficient Partitioning Algorithm for Grid Environments with Application to N-body Problems

  • Daniel J. Harvey
  • Sajal K. Das
  • Rupak Biswas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2668)


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.


Communication Cost Grid Environment Partition Graph Partitioning Algorithm Application Runtimes 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Barnes and P. Hut, “A hierarchical O(N log N) force calculation algorithm,” Nature, 324 (1986) 446–449.CrossRefGoogle Scholar
  2. 2.
    G. Cybenko, “Dynamic load balancing for distributed-memory multiprocessors,” Journal of Parallel and Distributed Computing, 7 (1989) 279–301.CrossRefGoogle Scholar
  3. 3.
    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.zbMATHCrossRefGoogle Scholar
  4. 4.
    I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, 1999.Google Scholar
  5. 5.
    Globus Project, See URL
  6. 6.
    B. Hendrickson and R. Leland, “A multilevel algorithm for partitioning graphs,” Technical Report SAND93-1301, Sandia National Laboratories, 1993.Google Scholar
  7. 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. 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
  9. 9.
    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.CrossRefGoogle Scholar
  10. 10.
    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.zbMATHCrossRefGoogle Scholar
  11. 11.
    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.CrossRefGoogle Scholar
  12. 12.
    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.zbMATHCrossRefGoogle Scholar
  13. 13.
    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.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Daniel J. Harvey
    • 1
  • Sajal K. Das
    • 2
  • Rupak Biswas
    • 3
  1. 1.CS Dept.Southern Oregon Univ.Ashland
  2. 2.CS Dept.Univ. of Texas at ArlingtonArlington
  3. 3.NASA Ames Research CenterMoffett Field

Personalised recommendations