Paper Info
Title
Parallel Multilevel Tetrahedral Grid Refinement
Abstract
In this paper we analyze a parallel version of a multilevel red/green local refinement algorithm for tetrahedral meshes. The refinement method is similar to the approaches used in the UG-package [UG, http://cox.iwr.uni-heidelberg.de/~ug] and by Bey [Computing, 55 (1995), pp. 355--378; Finite-Volumen- und Mehrgitterverfahren für Elliptische Randwertprobleme, Ph. D. thesis, Universität Tübingen, Tübingen, Germany, 1997]. We introduce a new data distribution format that is very suitable for the parallel multilevel refinement algorithm. This format is called an admissible hierarchical decomposition. We will prove that the application of the parallel refinement algorithm to an input admissible hierarchical decomposition yields an admissible hierarchical decomposition. The analysis shows that the data partitioning between the processors is such that we have a favorable data locality (e.g., parent and children are on the same processor) and at the same time only a small number of copies.
Year
DOI
Venue
2005
10.1137/S1064827503425237
SIAM J. Scientific Computing
Keywords
Field
DocType
consistent triangu- lations,parallel multilevel refinement algorithm,green local refinement algorithm,parallel multilevel tetrahedral grid,stable refinement,tetrahedral grid refinement,parallel refinement algorithm,parallelization,parallel version,new data distribution format,multilevel red,input admissible hierarchical decomposition,admissible hierarchical decomposition,favorable data locality,refinement method
Locality,Computer science,Parallel algorithm,Algorithm,Decomposition method (constraint satisfaction),Triangulation (social science),Numerical analysis,Tetrahedron,Data partitioning,Grid
Journal
Volume
Issue
ISSN
26
4
1064-8275
Citations 
PageRank 
References 
10
1.34
11
Authors
2
Name
Order
Citations
PageRank
Sven Gross1386.48
Arnold Reusken230544.91