Efficient parallelization for AMR MHD multiphysics calculations; implementation in AstroBEAR

Jonathan Carroll-Nellenback

doi:10.1016/j.jcp.2012.10.004

2013-03-01

Jonathan Carroll-Nellenback *

Brandon Shroyer

Adam Frank

Chen Ding

DOI：10.1016/j.jcp.2012.10.004

原文链接

查看原文

摘要

En 中文

Current adaptive mesh refinement (AMR) simulations require algorithms that are highly parallelized and manage memory efficiently. As compute engines grow larger, AMR simulations will require algorithms that achieve new levels of efficient parallelization and memory management. We have attempted to employ new techniques to achieve both of these goals. Patch or grid based AMR often employs ghost cells to decouple the hyperbolic advances of each grid on a given refinement level. This decoupling allows each grid to be advanced independently. In AstroBEAR we utilize this independence by threading the grid advances on each level with preference going to the finer level grids. This allows for global load balancing instead of level by level load balancing and allows for greater parallelization across both physical space and AMR level. Threading of level advances can also improve performance by interleaving communication with computation, especially in deep simulations with many levels of refinement. While we see improvements of up to 30% on deep simulations run on a few cores, the speedup is typically more modest (5-20%) for larger scale simulations. To improve memory management we have employed a distributed tree algorithm that requires processors to only store and communicate local sections of the AMR tree structure with neighboring processors. Using this distributed approach we are able to get reasonable scaling efficiency (>80%) out to 12288 cores and up to 8 levels of AMR - independent of the use of threading. (c) 2012 Elsevier Inc. All rights reserved.

Keyword:

Adaptive mesh refinement

Parallel

High performance computing

Distributed tree

Threading