Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published November 2010 | public
Book Section - Chapter

Extreme-Scale AMR

Abstract

Many problems are characterized by dynamics occurring on a wide range of length and time scales. One approach to overcoming the tyranny of scales is adaptive mesh refinement/coarsening (AMR), which dynamically adapts the mesh to resolve features of interest. However, the benefits of AMR are difficult to achieve in practice, particularly on the petascale computers that are essential for difficult problems. Due to the complex dynamic data structures and frequent load balancing, scaling dynamic AMR to hundreds of thousands of cores has long been considered a challenge. Another difficulty is extending parallel AMR techniques to high-order-accurate, complex-geometry-respecting methods that are favored for many classes of problems. Here we present new parallel algorithms for parallel dynamic AMR on forest-ofoctrees geometries with arbitrary-order continuous and discontinuous finite/spectral element discretizations. The implementations of these algorithms exhibit excellent weak and strong scaling to over 224,000 Cray XT5 cores for multiscale geophysics problems.

Additional Information

© 2010 IEEE. Date of Current Version: 29 November 2010; Issue Date: 13-19 November 2010. This work was partially supported by NSF (OCI-0749334, OCI-0748898, CCF-0427985, DMS-0724746, OPP-0941678), AFOSR (FA9550-09-1-0608), and DOE (06ER25782, 08ER25860, 08NA28615, SC0002710). We thank Laura Alisic, George Biros, Martin Burtscher, Rahul Sampath, and Tiankai Tu for extended discussions. We also thank TACC for providing access to Ranger under TeraGrid award MCA04N026, and the NCCS/ORNL for early-user access to Jaguar.

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023