Efficient Parallelization for AMR MHD Multiphysics Calculations; Implementation in AstroBEAR

Understand

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.