p4est : Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees

(ProQuest: ... denotes formulae/symbols omitted.)The authors present scalable algorithms for parallel adaptive mesh refinement and coarsening (AMR), partitioning, and 2:1 balancing on computational domains composed of multiple connected two-dimensional quadtrees or three-dimensional octrees, referre...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:SIAM journal on scientific computing Ročník 33; číslo 3; s. 1103 - 1133
Hlavní autori: Burstedde, Carsten, Wilcox, Lucas C., Ghattas, Omar
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2011
SIAM
Predmet:
Adaptive algorithms
Algorithms
Coarsening
Combinatorics
Combinatorics. Ordered structures
Computation
Designs and configurations
Exact sciences and technology
Forests
Mathematics
Methods of scientific computing (including symbolic computation, algebraic computation)
Numerical analysis
Numerical analysis. Scientific computation
Octrees
Partial differential equations, boundary value problems
Partial differential equations, initial value problems and time-dependant initial-boundary value problems
Partitioning
Sciences and techniques of general use
Studies
Symbols
scalable algo
Parallel algorithm
Three-dimensional calculations
Grid pattern
Adaptive algorithm
Initial value problem
68W10
forest of octrees
65Y05
Partial differential equation
Implementation
Numerical analysis
Boundary value problem
Scientific computation
Graph connectivity
parallel adaptive mesh refinement
Morton code
rithms
large-scale scientific computing
Two-dimensional calculations
Software
65M50
65D18
ISSN:1064-8275, 1095-7197
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:(ProQuest: ... denotes formulae/symbols omitted.)The authors present scalable algorithms for parallel adaptive mesh refinement and coarsening (AMR), partitioning, and 2:1 balancing on computational domains composed of multiple connected two-dimensional quadtrees or three-dimensional octrees, referred to as a forest of octrees. By distributing the union of octants from all octrees in parallel, they combine the high scalability proven previously for adaptive single-octree algorithms with the geometric flexibility that can be achieved by arbitrarily connected hexahedral macromeshes, in which each macroelement is the root of an adapted octree. A key concept of their approach is an encoding scheme of the interoctree connectivity that permits arbitrary relative orientations between octrees. They demonstrate the parallel scalability of p4est on its own and in combination with two geophysics codes. Using p4est they generate and adapt multioctree meshes with up to 5.13 x ... octants on as many as 220,320 CPU cores and execute the 2:1 balance algorithm in less than 10 seconds per million octants per process.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
None
USDOE Office of Science (SC)
SC0002710
ISSN:1064-8275
1095-7197
DOI:10.1137/100791634