Abstract
Adaptive mesh refinement (AMR) applications to solve partial differential equations (PDE) are very challenging to scale efficiently to the petascale regime. We describe optimizations to the Chombo AMR framework that enable it to scale efficiently to petascale on the Cray XT5. We describe an example of a hyperbolic solver (inviscid gas dynamics) and an matrix-free geometric multigrid elliptic solver. Both show good weak scaling to 131K processors without any thread-level or SIMD vector parallelism. This paper describes the algorithms used to compress the Chombo metadata and the optimizations of the Chombo infrastructure that are necessary for this scaling result. That we are able to achieve petascale performance without distribution of the metadata is a significant advance which allows for much simpler and faster AMR codes. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Van Straalen, B., Colella, P., Graves, D. T., & Keen, N. (2011). Petascale block-structured AMR applications without distributed meta-data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6853 LNCS, pp. 377–386). https://doi.org/10.1007/978-3-642-23397-5_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.