DocumentCode
2356636
Title
Partitioning and mapping of mesh-based applications onto computational grids
Author
Wanschoor, Renaud ; Aubanel, Eric
Author_Institution
Fac. of Comput. Sci., New Brunswick Univ., Fredericton, NB, Canada
fYear
2004
fDate
8 Nov. 2004
Firstpage
156
Lastpage
162
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. We 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.
Keywords
computational complexity; graph theory; grid computing; mesh generation; partial differential equations; PaGrid; computational complexity; computational grid; grid computing; mesh partition; mesh-based application; partial differential equation; Application software; Computational complexity; Computational modeling; Computer applications; Computer networks; Computer science; Concurrent computing; Cost function; Grid computing; Partial differential equations;
fLanguage
English
Publisher
ieee
Conference_Titel
Grid Computing, 2004. Proceedings. Fifth IEEE/ACM International Workshop on
ISSN
1550-5510
Print_ISBN
0-7695-2256-4
Type
conf
DOI
10.1109/GRID.2004.48
Filename
1382827
Link To Document