Scalable overset computation between a forest-of-octrees- and an arbitrary distributed parallel mesh
🤖 AI Summary
This work addresses the challenge of one-way overset grid computations between adaptive octree forests and arbitrary distributed meshes in parallel environments. The authors propose a communication-free query-and-localization mechanism based on global Morton encoding, which implicitly encodes partition boundaries through Morton ordering to eliminate remote communication overhead. By integrating non-blocking MPI communication with local geometric search, the method efficiently performs cross-mesh data interpolation. It inherently supports load balancing and adaptive refinement within overlapping regions. The approach is validated for correctness in both two- and three-dimensional test cases and demonstrates excellent strong scalability and performance on up to 12,288 processor cores.
Application Category
📝 Abstract
We introduce an algorithm that performs a one-directional mesh overset of a parallel forest of octrees with another distributed mesh of unrelated partition. The forest mesh consists of several adaptively refined octrees. Individual smooth mappings for every tree allow to represent a broad range of geometric domains. The other mesh is generic and defines a distributed set of query points, e.g. stemming from a quadrature rule applied to each cell. We face the problem of finding data for all queries in the remote forest. The forest is partitioned according to its natural Morton ordering. Thus, the partition boundaries can be encoded globally with one Morton index per process, which allows for precise, communication-free searching of the queries in the partition geometry. This is necessary to organize non-blocking communication of the queries to the relevant processes only. In a subsequent local search of the forest, we process the incoming queries and return the data of interest to each query's origin. The algorithm can be generalized, for example to load balancing of the overset, or adaptive refinement of the meshes around their intersection area. In 2D and 3D example scenarios we demonstrate the algorithm's performance and scalability to 12,288 processes.
Problem
Research questions and friction points this paper is trying to address.
overset computation
forest-of-octrees
distributed mesh
parallel mesh
Morton ordering
Innovation
Methods, ideas, or system contributions that make the work stand out.
overset mesh
forest-of-octrees
Morton ordering
distributed parallel mesh
non-blocking communication
🔎 Similar Papers
No similar papers found.
