Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves
Parallel Computing - Special issue on parallelization techniques for numerical modelling
Vertex-labeling algorithms for the Hilbert spacefilling curve
Software—Practice & Experience
A blocking strategy on multicore architectures for dynamically adaptive PDE solvers
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Petascale Direct Numerical Simulation of Blood Flow on 200K Cores and Heterogeneous Architectures
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
A Parallel Geometric Multigrid Method for Finite Elements on Octree Meshes
SIAM Journal on Scientific Computing
Communications of the ACM
p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees
SIAM Journal on Scientific Computing
Peano—A Traversal and Storage Scheme for Octree-Like Adaptive Cartesian Multiscale Grids
SIAM Journal on Scientific Computing
A parallel adaptive cartesian PDE solver using space–filling curves
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
Optimizing the computation of n-point correlations on large-scale astronomical data
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
The present paper studies solvers for partial differential equations that work on dynamically adaptive grids stemming from spacetrees. Due to the underlying tree formalism, such grids efficiently can be decomposed into connected grid regions (clusters) on-the-fly. A graph on those clusters classified according to their grid invariancy, workload, multi-core affinity, and further meta data represents the inter-cluster communication. While stationary clusters already can be handled more efficiently than their dynamic counterparts, we propose to treat them as atomic grid entities and introduce a skip mechanism that allows the grid traversal to omit those regions completely. The communication graph ensures that the cluster data nevertheless are kept consistent, and several shared memory parallelization strategies are feasible. A hyperbolic benchmark that has to remesh selected mesh regions iteratively to preserve conforming tessellations acts as benchmark for the present work. We discuss runtime improvements resulting from the skip mechanism and the implications on shared memory performance and load balancing.