• DocumentCode
    3223611
  • Title

    Extreme-Scale AMR

  • Author

    Burstedde, Carsten ; Ghattas, Omar ; Gurnis, Michael ; Isaac, Tobin ; Stadler, Georg ; Warburton, Tim ; Wilcox, Lucas C.

  • Author_Institution
    Inst. for Comput. Eng. & Sci., Univ. of Texas at Austin, Austin, TX, USA
  • fYear
    2010
  • fDate
    13-19 Nov. 2010
  • Firstpage
    1
  • Lastpage
    12
  • 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.
  • Keywords
    data structures; mesh generation; octrees; parallel algorithms; partial differential equations; resource allocation; Cray XT5 cores; adaptive mesh refinement; arbitrary-order continuous discretizations; complex-geometry-respecting methods; discontinuous spectral discretizations; dynamic AMR scaling; dynamic data structures; extreme-scale AMR; forest-of-octrees geometry; load balancing; multiscale geophysics problems; parallel AMR techniques; parallel algorithms; petascale computers; spectral element discretizations; Geometry; Heuristic algorithms; Joining processes; Octrees; Partitioning algorithms; Runtime; Scalability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Computing, Networking, Storage and Analysis (SC), 2010 International Conference for
  • Conference_Location
    New Orleans, LA
  • Print_ISBN
    978-1-4244-7557-5
  • Electronic_ISBN
    978-1-4244-7558-2
  • Type

    conf

  • DOI
    10.1109/SC.2010.25
  • Filename
    5644907