Construction and Application of an AMR Algorithm for Distributed Memory Computers
- Creators
- Deiterding, Ralf
Abstract
While the parallelization of blockstructured adaptive mesh refinement techniques is relatively straight-forward on shared memory architectures, appropriate distribution strategies for the emerging generation of distributed memory machines are a topic of on-going research. In this paper, a locality-preserving domain decomposition is proposed that partitions the entire AMR hierarchy from the base level on. It is shown that the approach reduces the communication costs and simplifies the implementation. Emphasis is put on the effective parallelization of the flux correction procedure at coarse-fine boundaries, which is indispensable for conservative finite volume schemes. An easily reproducible standard benchmark and a highly resolved parallel AMR simulation of a diffracting hydrogen-oxygen detonation demonstrate the proposed strategy in practice.
Additional Information
Also available in the Caltech Center for Simulation of Dynamic Response in Materials archive, cit-asci-tr282 at http://csdrm.caltech.edu/publications/Files
Name | Size | Download all |
---|---|---|
md5:413b0c6c36adca48b52bc5a38c7794ed
|
404.3 kB | Preview Download |
Additional details
- Eprint ID
- 28207
- Resolver ID
- CaltechCACR:2003.209
- Created
-
2005-01-18Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Center for Advanced Computing Research