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

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Harvey, D. J., Das, S. K., & Biswas, R. (2003). Designing an efficient partitioning algorithm for grid environments with application to N-body problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2668, 279–289. https://doi.org/10.1007/3-540-44843-8_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free