Paper Info
Title
Partitioning and Mapping of Mesh-Based Applications onto Computational Grids
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.
Year
DOI
Venue
2004
10.1109/GRID.2004.48
GRID
Keywords
Field
DocType
mesh partitioners,homogeneous partitioner,heterogeneous partitioner,execution time,estimated execution time,heterogeneous mesh partitioner,computing platform,computational platform,mesh-based applications,computational grid,computational grids,computational complexity,grid computing,partial differential equation,graph theory,mesh generation,partial differential equations,cost function
Graph theory,Asymptotic computational complexity,Grid computing,Computer science,Numerical partial differential equations,Adaptive mesh refinement,Mesh generation,Computational resource,Distributed computing,Computational complexity theory
Conference
ISBN
Citations 
PageRank 
0-7695-2256-4
5
0.48
References 
Authors
9
2
Name
Order
Citations
PageRank
Renaud Wanschoor170.88
Eric Aubanel2579.75