Local adaptive mesh refinement for shock hydrodynamics
Journal of Computational Physics
The design and analysis of spatial data structures
The design and analysis of spatial data structures
A parallel algorithm for multilevel graph partitioning and sparse matrix ordering
Journal of Parallel and Distributed Computing
A solution-adaptive upwind scheme for ideal magnetohydrodynamics
Journal of Computational Physics
A common data management infrastructure for adaptive algorithms for PDE solutions
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
An Application-Centric Characterization of Domain-Based SFC Partitioners for Parallel SAMR
IEEE Transactions on Parallel and Distributed Systems
Geographical locality and dynamic data migration for OpenMP implementations of adaptive PDE solvers
IWOMP'05/IWOMP'06 Proceedings of the 2005 and 2006 international conference on OpenMP shared memory parallel programming
| Hi-index | 0.00 |
This paper presents an experimental comparison of dynamic partitioning techniques for blockwise parallel structured adaptive mesh refinement applications. A new partitioning technique, G-MISP, is described. Policies for the automatic selection of partitioner based on application and system state are outlined. Adaptive methods for the numerical solution to partial differential equations yield highly advantageous ratios for cost/accuracy compared to methods based upon static uniform approximations. Distributed implementations offer the potential for accurate solution of physically realistic models of important applications. They also lead to interesting challenges in dynamic resource allocation, e.g. dynamic load balancing. The results show that G-MISP is preferable for communication dominated cases where the block graph has high granularity. Recommendations for appropriate partitioning techniques, given application and system state, are given. It was found that our classification model needs to be extended to accurately capture the behavior of the cases studied.