Designing an efficient partitioning algorithm for grid environments with application to N-body problems

Authors:
Daniel J. Harvey;Sajal K. Das;Rupak Biswas
Affiliations:
CS Dept., Southern Oregon Univ., Ashland, OR;CS Dept., Univ. of Texas at Arlington, Arlington, TX;NASA Ames Research Center, Moffett Field, CA
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Year:
2003

Citing 9
Cited 0

Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
Load balancing and data locality in adaptive hierarchical N-body methods: Barnes-Hut, fast multipole, and radiosity

Journal of Parallel and Distributed Computing
Parallel dynamic graph partitioning for adaptive unstructured meshes

Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Parallelization of a Dynamic Unstructured Algorithm Using Three Leading Programming Paradigms

IEEE Transactions on Parallel and Distributed Systems
MinEX: a latency-tolerant dynamic partitioner for grid computing applications

Future Generation Computer Systems - Best papers from symp. on cluster computing and the grid (CCGRID 2001)
A comparison of three programming models for adaptive applications on the origin2000

Journal of Parallel and Distributed Computing
Graph Partitioning for Parallel Applications in Heterogeneous Grid Environments

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Message passing and shared address space parallelism on an SMP cluster

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

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.