Extreme-Scale AMR

• Main Authors: Burstedde, Carsten, Ghattas, Omar, Gurnis, Michael, Isaac, Tobin, Stadler, Georg, Warburton, Tim, Wilcox, Lucas
• Format: Conference Proceeding
• Language: English
• Subjects: Geometry; Heuristic algorithms; Joining processes; Mathematics of computing; Mathematics of computing > Mathematical analysis; Mathematics of computing > Mathematical analysis > Differential equations; Mathematics of computing > Mathematical analysis > Differential equations > Partial differential equations; Octrees; Partitioning algorithms; Runtime; Scalability
• ISSN: 2167-4329; 2167-4337
• DOI: 10.1109/SC.2010.25

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.