Abstract
Given the proliferation of layered, multicore- and SMT-based architectures, it is imperative to deploy and evaluate important, multi-level, scientific computing codes, such as meshing algorithms, on these systems. We focus on Parallel Constrained Delaunay Mesh (PCDM) generation. We exploit coarse-grain parallelism at the subdomain level, medium-grain at the cavity level and fine-grain at the element level. This multi-grain data parallel approach targets clusters built from commercially available SMTs and multicore processors. The exploitation of the coarser degree of granularity facilitates scalability both in terms of execution time and problem size on loosely-coupled clusters. The exploitation of medium-grain parallelismallowsperformanceimprovementatthesinglenodelevel.Ourexperimentalevaluationshows that the first generation of SMTcoresisnotcapableoftakingadvantageoffine-grainparallelisminPCDM. Manyofour experimental findings with PCDM extend to other adaptive and irregular multigrain parallel algorithms as well.
Original language | English |
---|---|
Pages (from-to) | 589-600 |
Number of pages | 12 |
Journal | Journal of Parallel and Distributed Computing |
Volume | 69 |
Issue number | 7 |
DOIs | |
Publication status | Published - Jul 2009 |
Externally published | Yes |
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Networks and Communications
- Hardware and Architecture
- Software
- Theoretical Computer Science