Accession Number:

ADA272245

Title:

A Parallel Adaptive Mesh Refinement Algorithm

Descriptive Note:

Contractor rept.

Corporate Author:

INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA

Personal Author(s):

Report Date:

1993-08-01

Pagination or Media Count:

31.0

Abstract:

Over recent years, Adaptive Mesh Refinement AMR algorithms which dynamically match the local resolution of the computational grid to the numerical solution being sought have emerged as powerful tools for solving problems that contain disparate length and time scales. In particular, several workers have demonstrated the effectiveness of employing an adaptive, block- structured hierarchical grid system for simulations of complex shock wave phenomena. Unfortunately, from the parallel algorithm developers viewpoint, this class of scheme is quite involved these schemes cannot be distilled down to a small kernel upon which various parallelizing strategies may be tested. However, because of their block-structured nature such schemes are inherently parallel, so all is not lost. In this paper we describe the method by which Quirks AMR algorithm has been parallelized. This method is built upon just a few simple message passing routines and so it may be implemented across a broad class of MIMD machines. Moreover, the method of parallelization is such that the original serial code is left virtually intact, and so we are left with just a single product to support. The importance of this fact should not be underestimated given the size and complexity of the original algorithm. Adaptive mesh refinement, Distributed computing, Message passing paradigm

Subject Categories:

  • Computer Systems Management and Standards

Distribution Statement:

APPROVED FOR PUBLIC RELEASE