Partitioning and Mapping of Mesh-Based Applications onto Computational Grids

Authors:
Renaud Wanschoor;Eric Aubanel
Affiliations:
University of New Brunswick, Canada;University of New Brunswick, Canada
Venue:
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Year:
2004

Citing 8
Cited 1

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Balancing load versus decreasing communication: parameterizing the tradeoff

Journal of Parallel and Distributed Computing
Mesh Partitioning for Efficient Use of Distributed Systems

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)
SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs

HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Graph partitioning for high-performance scientific simulations

Sourcebook of parallel computing
Software for the scalable solution of partial differential equations

Sourcebook of parallel computing
Mesh partitioners for computational grids: a comparison

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII

Architecture Aware Partitioning Algorithms

ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mesh-based applications, such as those that involve the numerical solution of partial differential equations, may be able to take advantage of the performance of computational grids. To do so will require mesh partitioners that take the heterogeneity of the computational platform into account. Recent work in our group led to the creation of a heterogeneous mesh partitioner, PaGrid. We present a redesigned version of PaGrid, which uses estimated execution time as a cost function in all levels of multilevel refinement. It takes into account the characteristics of the application (computational complexity and size of messages) and of the computing platform (processor and network speeds), and balances the estimated execution time of processors. This results in partitions with up to 60% lower estimated execution times than METIS, a homogeneous partitioner, and similar improvements over JOSTLE, a heterogeneous partitioner. PaGrid achieves this in a reasonable amount of time, taking only two to three times longer than METIS.