Abstract
Given the importance of parallel mesh generation in large-scale scientific applications and the proliferation of multilevel SMT-based architectures, it is imperative to obtain insight on the interaction between meshing algorithms and these systems. We focus on Parallel Constrained Delaunay Mesh (PCDM) generation. We exploit coarse-grain parallelism at the subdomain level and fine-grain at the element level. This multigrain data parallel approach targets clusters built from low-end, commercially available SMTs. Our experimental evaluation shows that current SMTs are not capable of executing fine-grain parallelism in PCDM. However, experiments on a simulated SMT indicate that with modest hardware support it is possible to exploit fine-grain parallelism opportunities. The exploitation of fine-grain parallelism results to higher performance than a pure MPI implementation and closes the gap between the performance of PCDM and the state-of-the-art sequential mesher on a single physical processor. Our findings extend to other adaptive and irregular multigrain, parallel algorithms.
Original language | English (US) |
---|---|
Pages | 367-376 |
Number of pages | 10 |
DOIs | |
State | Published - 2005 |
Externally published | Yes |
Event | ICS05 - 19th ACM International Conference on Supercomputing - Cambridge, MA, United States Duration: Jun 20 2005 → Jun 22 2005 |
Other
Other | ICS05 - 19th ACM International Conference on Supercomputing |
---|---|
Country/Territory | United States |
City | Cambridge, MA |
Period | 6/20/05 → 6/22/05 |
All Science Journal Classification (ASJC) codes
- General Computer Science