On the Use of Space Filling Curves for ParallelAnisotropic Mesh Adaptation
Alauzet, Frederic and Adrien Loseille
Proceedings, 18th International Meshing Roundtable, Springer-Verlag, pp.337-357, October 25-28 2009
18th International Meshing Roundtable
Salt Lake City, UT, USA.
October 25-28, 2009
1 INRIA Paris-Rocquencourt, Projet Gamma, Domaine de Voluceau, BP 105,
78153 Le Chesnay cedex, France
2 CFD Center, Dept. of Computational and Data Sciences, College of Science,
MS 6A2, George Mason University, Fairfax, VA 22030-4444, USA
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 and
illustrates its use with two different approaches to parallelization: an out-of-core
method and a shared-memory multi-threaded algorithm.
Download Full Paper (PDF Format)
Contact author(s) or publisher for availability and copyright information on above referenced article