Local adaptive mesh refinement for shock hydrodynamics
Journal of Computational Physics
Fluids in the universe: adaptive mesh refinement in cosmology
Computing in Science and Engineering
Partitioning strategies for structured multiblock grids
Parallel Computing - Special issue on graph partioning and parallel computing
Highly parallel structured adaptive mesh refinement using parallel language-based approaches
Parallel Computing - new trends in high performance computing
Large scale parallel structured AMR calculations using the SAMRAI framework
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Dynamic load balancing of SAMR applications on distributed systems
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
An Application-Centric Characterization of Domain-Based SFC Partitioners for Parallel SAMR
IEEE Transactions on Parallel and Distributed Systems
Dynamic Load Balancing for Structured Adaptive Mesh Refinement Applications
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Flexible Communication Mechanisms for Dynamic Structured Applications
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Hierarchical Partitioning Techniques for Structured Adaptive Mesh Refinement Applications
The Journal of Supercomputing
A Partitioner-Centric Model for SAMR Partitioning Trade-Off Optimization: Part II
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
| Hi-index | 0.00 |
Achieving good scalability for large simulations based on structured adaptive mesh refinement is non-trivial. Performance is limited by the partitioner's ability to efficiently use the underlying parallel computerýs resources. Domainbased partitioners serve as a foundation for techniques designed to improve the scalability and they have traditionally been designed on the basis of an independence assumption regarding the computational flow among grid patches at different refinement levels. But this assumption does not hold in practice. Hence the effectiveness of these techniques is significantly impaired. This paper introduces a partitioning method designed on the true premises. The method is tested for four different applications exhibiting different behaviors. The results show that synchronization costs on average can be reduced by 75 percent. The conclusion is that the method is suitable as a foundation in general hierarchical methods designed to improve the scalability of structured adaptive mesh refinement applications.