A multigrain Delaunay mesh generation method for multicore SMT-based architectures

  • Authors:

  • Christos D. Antonopoulos;Filip Blagojevic;Andrey N. Chernikov;Nikos P. Chrisochoides;Dimitrios S. Nikolopoulos

  • Affiliations:

  • Department of Computer and Communications Engineering, University of Thessaly, Volos, Greece;Lawrence Berkeley National Lab, Berkeley, CA 94720, United States;Department of Computer Science, The College of William and Mary, Williamsburg, VA 23187, United States;Department of Computer Science, The College of William and Mary, Williamsburg, VA 23187, United States;Department of Computer Science, Virginia Tech, Blacksburg, VA 24061, United States

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 parallelism allows performance improvement at the single node level. Our experimental evaluation shows that the first generation of SMT cores is not capable of taking advantage of fine-grain parallelism in PCDM. Many of our experimental findings with PCDM extend to other adaptive and irregular multigrain parallel algorithms as well.