Enhancing scalability of parallel structured AMR calculations | Zendy

Andrew M. Wissink | Zendy; David Hysom | Zendy; Richard D. Hornung | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Enhancing scalability of parallel structured AMR calculations

Author(s) -

Andrew M. Wissink,

David Hysom,

Richard D. Hornung

Publication year - 2003

Publication title -

osti oai (u.s. department of energy office of scientific and technical information)

Language(s) - English

Resource type - Conference proceedings

ISBN - 1-58113-733-8

DOI - 10.1145/782814.782861

Subject(s) - computer science , scalability , ibm , parallel computing , computation , distributed computing , parallel algorithm , graph , supercomputer , computer cluster , scaling , theoretical computer science , operating system , algorithm , materials science , geometry , mathematics , nanotechnology

We discuss parallel performance of structured adaptive mesh refinement calculations using the SAMRAI library. We focus on fundamental aspects of adaptive gridding and dynamic computation of changing data dependencies. Previous analysis of performance of large-scale parallel adaptive calculations revealed poor scaling in these operations. Specifically, we found that these operations are inexpensive for small problems, but that their costs can become unacceptable for problems run on large numbers of processors. This paper describes subsequent developments involving graph- and tree-based algorithms that reduce runtime complexity and substantially increase scalability. We characterize performance on realistic adaptive problems using up to 512 processors of an IBM SP system and up to 1024 processors of a Linux cluster.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research