The NIRVANA code: Parallel computational MHD with adaptive mesh refinement

doi:10.1016/j.cpc.2008.02.017

Return

The NIRVANA code: Parallel computational MHD with adaptive mesh refinement

2008-08-01

PRE

Ziegler, U. *

DOI：10.1016/j.cpc.2008.02.017

Original

Original request for help

Save

Abstract

En 中文

I report on a new version of the magnetohydrodynamics code NIRVANA(1) which is targeted at the study of astrophysical problems. The new version allows for distributed-memory simulations supporting adaptive mesh refinement. Numerical algorithms include dissipative terms (viscosity, Ohmic diffusion, thermal heat conduction) in a conservative form. Domain decomposition is preferably block-wise in case of unigrid applications but adopts space-filling curve techniques for adaptive mesh applications with a hierarchical block-structured mesh. The code architecture facilitates workload balancing among processors for arbitrary mesh refinement depths maintaining intra-level data locality via space-filling curve mappings and, at the same time, ensuring inter-level data locality by applying a novel technique called block sharing. This way, it is demonstrated that comparable performance can be achieved for problems with locally highly refined grid. The data transfer between processors extensively utilizes the coarse-granularity concept of parallel computing and makes use of the MPI library. Conservation properties of the numerical method carry over to the parallel framework. In particular, the solenoidality condition for the magnetic field is preserved to roundoff precision applying the constrained transport machinery. This paper has its focus of discussion on implementation details related to the parallelization and on a code performance analysis. (C) 2008 Elsevier B.V. All rights reserved.

Keywords:

magnetohydrodynamics

numerics

central schemes

adaptive mesh refinement

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.