Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves
Parallel Computing - Special issue on parallelization techniques for numerical modelling
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Scalable Parallel Octree Meshing for TeraScale Applications
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
SIAM Journal on Scientific Computing
Dendro: parallel algorithms for multigrid and AMR methods on 2:1 balanced octrees
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Scalable adaptive mantle convection simulation on petascale supercomputers
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
International Journal of High Performance Computing Applications
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Scalable Earthquake Simulation on Petascale Supercomputers
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Towards multi-phase flow simulations in the PDE framework Peano
Computational Mechanics
PRACE DECI (distributed european computing initiative) minisymposium
PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
Cluster optimization and parallelization of simulations with dynamically adaptive grids
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
Almost all approaches to solving partial differential equations (PDEs) are based upon a spatial discretization of the computational domain—a grid. This paper presents an algorithm to generate, store, and traverse a hierarchy of $d$-dimensional Cartesian grids represented by a $(k=3)$-spacetree, a generalization of the well-known octree concept, and it also shows the correctness of the approach. These grids may change their adaptive structure throughout the traversal. The algorithm uses $2d+4$ stacks as data structures for both cells and vertices, and the storage requirements for the pure grid reduce to one bit per vertex for both the complete grid connectivity structure and the multilevel grid relations. Since the traversal algorithm uses only stacks, the algorithm's cache hit rate is continually higher than 99.9 percent, and the runtime per vertex remains almost constant; i.e., it does not depend on the overall number of vertices or the adaptivity pattern. We use the algorithmic approach as the fundamental concept for a mesh management for $d$-dimensional PDEs and for a matrix-free PDE solver represented by a compact discrete $3^d$-point operator. In the latter case, one can implement a Jacobi smoother, a Krylov solver, or a geometric multigrid scheme within the presented traversal scheme which inherits the low memory requirements and the good memory access characteristics directly.