Autotuning of Adaptive Mesh Refinement PDE Solvers on Shared Memory Architectures
KAUST Grant NumberUK-c0020
Permanent link to this recordhttp://hdl.handle.net/10754/597640
MetadataShow full item record
AbstractMany multithreaded, grid-based, dynamically adaptive solvers for partial differential equations permanently have to traverse subgrids (patches) of different and changing sizes. The parallel efficiency of this traversal depends on the interplay of the patch size, the architecture used, the operations triggered throughout the traversal, and the grain size, i.e. the size of the subtasks the patch is broken into. We propose an oracle mechanism delivering grain sizes on-the-fly. It takes historical runtime measurements for different patch and grain sizes as well as the traverse's operations into account, and it yields reasonable speedups. Neither magic configuration settings nor an expensive pre-tuning phase are necessary. It is an autotuning approach. © 2012 Springer-Verlag.
CitationNogina S, Unterweger K, Weinzierl T (2012) Autotuning of Adaptive Mesh Refinement PDE Solvers on Shared Memory Architectures. Lecture Notes in Computer Science: 671–680. Available: http://dx.doi.org/10.1007/978-3-642-31464-3_68.
SponsorsThis publication is partially based on work supportedby Award No. UK-c0020, made by the King Abdullah University of Science andTechnology (KAUST). Computing resources for the present work have also beenprovided by the Gauss Centre for Supercomputing under grant pr63no.
PublisherSpringer Science + Business Media