Construction and Application of an AMR Algorithm for Distributed Memory Computers

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

A tetrahedral space-filling curve for non-conforming adaptive meshes

We introduce a space-filling curve for triangular and tetrahedral red-refinement that can be computed using bitwise interleaving operations similar to the well-known Z-order or Morton curve for cubical meshes. To store sufficient information for random access, we define a low-memory encoding using 10 bytes per triangle and 14 bytes per tetrahedron. We present algorithms that compute the parent, children, and face-neighbors of a mesh element in constant time, as well as the next and previous element in the space-filling curve and whether a given element is on the boundary of the root simplex or not. Our presentation concludes with a scalability demonstration that creates and adapts selected meshes on a large distributed-memory system.Comment: 33 pages, 12 figures, 8 table

A Comparison of Two Shallow Water Models with Non-Conforming Adaptive Grids: classical tests

In an effort to study the applicability of adaptive mesh refinement (AMR) techniques to atmospheric models an interpolation-based spectral element shallow water model on a cubed-sphere grid is compared to a block-structured finite volume method in latitude-longitude geometry. Both models utilize a non-conforming adaptation approach which doubles the resolution at fine-coarse mesh interfaces. The underlying AMR libraries are quad-tree based and ensure that neighboring regions can only differ by one refinement level. The models are compared via selected test cases from a standard test suite for the shallow water equations. They include the advection of a cosine bell, a steady-state geostrophic flow, a flow over an idealized mountain and a Rossby-Haurwitz wave. Both static and dynamics adaptations are evaluated which reveal the strengths and weaknesses of the AMR techniques. Overall, the AMR simulations show that both models successfully place static and dynamic adaptations in local regions without requiring a fine grid in the global domain. The adaptive grids reliably track features of interests without visible distortions or noise at mesh interfaces. Simple threshold adaptation criteria for the geopotential height and the relative vorticity are assessed.Comment: 25 pages, 11 figures, preprin