Mesh reordering in Fluidity using Hilbert space-filling curves
نویسنده
چکیده
Fluidity is open-source, multi-scale, general purpose CFD model. It is a finite element model using an unstructured mesh which is adapted during the course of a simulation. Reordering of the mesh elements and vertices has been implemented, reordering occurring at input and at each adapt step. For an OpenMP simulation using all 4 UMA regions in a single HECToR node, a 3‒5% performance improvement is seen overall, with a 5‒20% improvement in the threaded element assembly and solve steps.
منابع مشابه
On the Use of Space Filling Curves for Parallel Anisotropic Mesh Adaptation
Efficiently parallelizing a whole set of meshing tools, as required by an automated mesh adaptation loop, relies strongly on data localization to avoid memory access contention. In this regard, renumbering mesh items through a space filling curve (SFC), like Hilbert or Peano, is of great help and proved to be quite versatile. This paper briefly introduces the Hilbert SFC renumbering technique a...
متن کاملReordering Columns for Smaller Indexes
Column-oriented indexes—such as projection or bitmap indexes—are compressed by run-length encoding to reduce storage and increase speed. Sorting the tables improves compression. On realistic data sets, permuting the columns in the right order before sorting can reduce the number of runs by a factor of two or more. For many cases, we prove that the number of runs in table columns is minimized if...
متن کاملApplications of Space-Filling Curves to Cartesian Methods for CFD
This paper presents a variety of novel uses of space-filling curves (SFCs) for Cartesian mesh methods in CFD. While these techniques will be demonstrated using non-body-fitted Cartesian meshes, many are applicable on general body-fitted meshes – both structured and unstructured. We demonstrate the use of single O ( N log N ) SFC-based reordering to produce single-pass ( O ( N )) algorithms for ...
متن کاملTime Complexity of algorithms that update the Sierpiński-like and Modified Hilbert Curves
This paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpiński-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the names...
متن کاملAlgebraic Formulation and Program Generation of Three-Dimensional Hilbert Space-Filling Curves
We use a tensor product based multi-linear algebra theory to formulate three-dimensional Hilbert space-filling curves. A 3-D Hilbert space-filling curve is specified as a permutation which rearranges threedimensional n n n data elements stored in the row major order as in C language or the column major order as in FORTRAN language to the order of traversing a 3-D Hilbert space-filling curve. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013