A numbering algorithm for finite elements on extruded meshes which avoids the unstructured mesh penalty
| Autor: | Lawrence Mitchell, Gheorghe-Teodor Bercea, Luigi Nardi, Fabio Luporini, David A. Ham, Paul H. J. Kelly, Andrew T. T. McRae, Florian Rathgeber |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
010504 meteorology & atmospheric sciences
Computer science 010103 numerical & computational mathematics Volume mesh 01 natural sciences Finite element method Numbering Set (abstract data type) Range (mathematics) Polygon mesh Limit (mathematics) 0101 mathematics Representation (mathematics) Algorithm ComputingMethodologies_COMPUTERGRAPHICS 0105 earth and related environmental sciences |
| Popis: | We present a generic algorithm for numbering and then efficiently iterating over the data values attached to an extruded mesh. An extruded mesh is formed by replicating an existing mesh, assumed to be unstructured, to form layers of prismatic cells. Applications of extruded meshes include, but are not limited to, the representation of 3D high aspect ratio domains employed by geophysical finite element simulations. These meshes are structured in the extruded direction. The algorithm presented here exploits this structure to avoid the performance penalty traditionally associated with unstructured meshes. We evaluate our algorithm on a range of low compute intensity operations which constitute worst cases for data layout performance exploration. The experiments show that having structure along the extruded direction enables the cost of the indirect data accesses to be amortized after 10–20 layers as long as the underlying mesh is well-ordered. We characterise the resulting spatial and temporal reuse in a representative set of both continuous-Galerkin and discontinuous-Galerkin discretisations. On meshes with realistic numbers of layers the performance achieved is between 70 % and 90 % of a theoretical hardware-specific limit. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|