Deiterding, Ralf (2003) Construction and Application of an AMR Algorithm for Distributed Memory Computers. In: Chicago Workshop on Adaptive Mesh Refinement Methods, 3-5 September 2003, Chicago, Illinois. http://resolver.caltech.edu/CaltechCACR:2003.209
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCACR:2003.209
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.
|Item Type:||Conference or Workshop Item (Paper)|
|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/|
|Group:||Center for Advanced Computing Research|
|Usage Policy:||You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.|
|Deposited By:||Imported from CaltechCACR|
|Deposited On:||18 Jan 2005|
|Last Modified:||26 Dec 2012 14:32|
Repository Staff Only: item control page