A paradigm for parallel unstructured grid generation
- Mississippi State Univ., MS (United States); and others
In this paper, a sequential 2D unstructured grid generator based on iterative point insertion and local reconnection is coupled with a Delauney tessellation domain decomposition scheme to create a scalable parallel unstructured grid generator. The Message Passing Interface (MPI) is used for distributed communication in the parallel grid generator. This work attempts to provide a generic framework to enable the parallelization of fast sequential unstructured grid generators in order to compute grand-challenge scale grids for Computational Field Simulation (CFS). Motivation for moving from sequential to scalable parallel grid generation is presented. Delaunay tessellation and iterative point insertion and local reconnection (advancing front method only) unstructured grid generation techniques are discussed with emphasis on how these techniques can be utilized for parallel unstructured grid generation. Domain decomposition techniques are discussed for both Delauney and advancing front unstructured grid generation with emphasis placed on the differences needed for both grid quality and algorithmic efficiency.
- OSTI ID:
- 416595
- Report Number(s):
- CONF-960489--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallelization of a dynamic unstructured algorithm using three leading programming paradigms
A comparative study between structured and unstructured applications of the flux-filter scheme