Scalable algorithms for distributed-memory adaptive mesh refinement

Akhil Langer, Jonathan Lifflander, Phil Miller, Kuo Chuan Pan, Laxmikant V Kale, Paul Milton Ricker

Research output: Contribution to journalConference articlepeer-review

Abstract

This paper presents scalable algorithms and data structures for adaptive mesh refinement computations. We describe a novel mesh restructuring algorithm for adaptive mesh refinement computations that uses a constant number of collectives regardless of the refinement depth. To further increase scalability, we describe a localized hierarchical coordinate-based block indexing scheme in contrast to traditional linear numbering schemes, which incur unnecessary synchronization. In contrast to the existing approaches which take O(P) time and storage per process, our approach takes only constant time and has very small memory footprint. With these optimizations as well as an efficient mapping scheme, our algorithm is scalable and suitable for large, highly-refined meshes. We present strong-scaling experiments up to 2k ranks on Cray XK6, and 32k ranks on IBM Blue Gene/Q.

Original languageEnglish (US)
Article number6374777
Pages (from-to)100-107
Number of pages8
JournalProceedings - Symposium on Computer Architecture and High Performance Computing
DOIs
StatePublished - Dec 1 2012
Event24th International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2012 - New York, NY, United States
Duration: Oct 24 2012Oct 26 2012

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Fingerprint Dive into the research topics of 'Scalable algorithms for distributed-memory adaptive mesh refinement'. Together they form a unique fingerprint.

Cite this