Cluster Optimization and Parallelization of Simulations with Dynamically Adaptive Grids

Martin Schreiber, Tobias Weinzierl, Hans-Joachim Bungartz

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Scopus citations

Abstract

The present paper studies solvers for partial differential equations that work on dynamically adaptive grids stemming from spacetrees. Due to the underlying tree formalism, such grids efficiently can be decomposed into connected grid regions (clusters) on-the-fly. A graph on those clusters classified according to their grid invariancy, workload, multi-core affinity, and further meta data represents the inter-cluster communication. While stationary clusters already can be handled more efficiently than their dynamic counterparts, we propose to treat them as atomic grid entities and introduce a skip mechanism that allows the grid traversal to omit those regions completely. The communication graph ensures that the cluster data nevertheless are kept consistent, and several shared memory parallelization strategies are feasible. A hyperbolic benchmark that has to remesh selected mesh regions iteratively to preserve conforming tessellations acts as benchmark for the present work. We discuss runtime improvements resulting from the skip mechanism and the implications on shared memory performance and load balancing. © 2013 Springer-Verlag.
Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science
PublisherSpringer Nature
Pages484-496
Number of pages13
ISBN (Print)9783642400469
DOIs
StatePublished - 2013
Externally publishedYes

Fingerprint Dive into the research topics of 'Cluster Optimization and Parallelization of Simulations with Dynamically Adaptive Grids'. Together they form a unique fingerprint.

Cite this