The Parallelization of an Advancing-Front, All-Quadrilateral Meshing Algorithm for Adaptive Analysis
Lober, Randy R., Timothy J. Tautges, Rich A. Cairncross
Proceedings, 4th International Meshing Roundtable, Sandia National Laboratories, pp.59-70, October 1995
The ability to perform effective adaptive analyis has become a critical issue in the area of physical simulation. Of the multiple technologies required to realize a parallel adaptive analysis capability, automatic mesh generation is an enabling technology, filling a critical need in the appropriate discretization of a problem domain. The paving algorithm's unique ability to generate a function-following quadrilateral grid is a substantial advantage in Sabdia's pursuit of a modified h-method adaptive capability. This characteristic combined with a strong transitioning ability allow the paving algorithm to place elements where an error function ndicates where more mesh resolution is needed. Other desirable characteristics of this algorithm include it's boundary sensitivity and orientation insensitivity (elements near the boundary are of the highest quality and the spatial orientation of the geometry has no effect on the resulting mesh).
Although the original paving algorithm is highly serial, a two-stage approach has been designed to parallize the algorithm but also retain the nice qualities of the serial algorithm. Our approach also allows the subdomain decomposition used by the meshing code to be shared with the finite element physics code, eliminating the need for data transfer accross the processors between the analysis and remeshing steps. In addition the meshed subdomains are adjusted with a dynamic load balancer to improve the original decomposition and maintain load efficiency each time the mesh has been regenerated.
The initial parallel implementation assumes an approach of restarting the physics problem from time zero at each iteration with a refined mesh adapting to the previous iterations' objective function. The remeshing tools are being developed to enable real-time remeshing and geometry regeneration. Progress on the redesign of the paving algorithm for parallel operation is discussed including extensions allowing adaptive control and geometry regeneration.
Download Full Paper (PDF)
Contact author(s) or publisher for availability and copyright information on above referenced article