• Login
    View Item 
    •   Home
    • Office of Sponsored Research (OSR)
    • KAUST Funded Research
    • Publications Acknowledging KAUST Support
    • View Item
    •   Home
    • Office of Sponsored Research (OSR)
    • KAUST Funded Research
    • Publications Acknowledging KAUST Support
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    ForestClaw: Hybrid forest-of-octrees AMR for hyperbolic conservation laws

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Burstedde, Carsten
    Calhoun, Donna
    Mandli, Kyle
    Terrel, Andy R.
    Date
    2014
    Permanent link to this record
    http://hdl.handle.net/10754/671340
    
    Metadata
    Show full item record
    Abstract
    We present a new hybrid paradigm for parallel adaptive mesh refinement (AMR) that combines the scalability and lightweight architecture of tree-based AMR with the computational efficiency of patch-based solvers for hyperbolic conservation laws. The key idea is to interpret each leaf of the AMR hierarchy as one uniform compute patch in Rd with md degrees of freedom, where m is customarily between 8 and 32. Thus, computation on each patch can be optimized for speed, while we inherit the flexibility of adaptive meshes. In our work we choose to integrate with the p4est AMR library since it allows us to compose the mesh from multiple mapped octrees and enables the cubed sphere and other nontrivial multiblock geometries. We describe aspects of the parallel implementation and close with scalings for both MPI-only and OpenMP/MPI hybrid runs, where the largest MPI run executes on 16,384 CPU cores. © 2014 The authors and IOS Press.
    Citation
    Burstedde Carsten, Calhoun Donna, Mandli Kyle, & Terrel Andy R. (2014). ForestClaw: Hybrid forest-of-octrees AMR for hyperbolic conservation laws [JB]. Advances in Parallel Computing, 25(Parallel Computing: Accelerating Computational Science and Engineering (CSE)), 253–262. https://doi.org/10.3233/978-1-61499-381-0-253
    Sponsors
    We would like to thank the Texas Advanced Computing Center (TACC) for access to the Stampede supercomputer under allocations TG-DPP130002 and TG-ASC130001 granted by the NSF XSEDE program. The authors acknowledge valuable discussion with Randy LeVeque, Marsha Berger, and Hans-Petter Langtangen. We also acknowledge David Ketcheson and the KAUST sponsored HPC3 numerics workshop at which the initial phases of this project were first discussed. The second author would like to also acknowledge the Isaac Newton Institute (Cambridge, UK), where much of the preliminary development work for ForestClaw was done. The fourth author recognizes Simula Research Lab, Norway, for funding. The leaf/patch paradigm was independently presented by B. as part of a talk at the SCI Institute, Salt Lake City, Utah, USA in July 2011.
    Publisher
    IOS Press BV
    Conference/Event name
    International Conference on Parallel Programming (ParCo)
    ISBN
    9781614993803
    DOI
    10.3233/978-1-61499-381-0-253
    Additional Links
    https://www.medra.org/servlet/aliasResolver?alias=iospressISSNISBN&issn=0927-5452&volume=25&spage=253
    ae974a485f413a2113503eed53cd6c53
    10.3233/978-1-61499-381-0-253
    Scopus Count
    Collections
    Publications Acknowledging KAUST Support

    entitlement

     
    DSpace software copyright © 2002-2022  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.