Elsevier Science Home
Computer Physics Communications Program Library
Full text online from Science Direct
Programs in Physics & Physical Chemistry
CPC Home

[Licence| Download | New Version Template] adlq_v1_0.tar.gz(3172 Kbytes)
Manuscript Title: PARAMESH: a parallel adaptive mesh refinement community toolkit.
Authors: P. MacNeice, K.M. Olson, C. Mobarry, R. de Fainchtein, C. Packer
Program title: PARAMESH
Catalogue identifier: ADLQ_v1_0
Distribution format: tar.gz
Journal reference: Comput. Phys. Commun. 126(2000)330
Programming language: Fortran.
Computer: Cray T3E, SGI Onyx 2, Beowolf Cluster, Cray J90.
Operating system: UNIX.
Number of processors used: 1 or more, determined by user.
Word size: 32 or 64
Keywords: Adaptive mesh refinement, Parallel programming, Structured grids, Hydrodynamics, Magnetohydrodynamics, General purpose, Other numerical.
Classification: 4.12.

Nature of problem:
A common problem in gas dynamics and magnetohydrodynamic simulation is achieving the large dynamic range in spatial resolution which can be necessary to accurately model the active physical processes. These simulations also tend to require the largest computers, which inevitably implies the additional complexity of a parallel computing environment.

Solution method:
PARAMESH is a package of Fortran 90 subroutines designed to provide an application developer with an easy route to extend an existing serial code which uses a logically cartesian structured mesh into a parallel code with adaptive mesh refinement (AMR). Alternatively, in its simplest use, and with minimal effort, it can operate as a domain decomposition tool for users who want to parallelize their serial codes, but who do not wish to use adaptivity.

Restrictions:
Applications which use PARAMESH must be based on logically cartesian numerical meshes. This means that it must be possible (in principle) to map the numerical mesh onto a cartesian mesh. Common examples of meshes which satisfy this criterion are cartesian, polar, spherical, cylindrical.

Running time:
Application dependent