A fine-grained parallelization of the immersed boundary method

We present new algorithms for the parallelization of Eulerian-Lagrangian interaction operations in the immersed boundary method. Our algorithms rely on two well-studied parallel primitives: key-value sort and segmented reduce. The use of these parallel primitives allows us to implement our algorithm...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Kassen, Andrew, Shankar, Varun, Fogelson, Aaron L
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 29.10.2021
Subjects
Algorithms
Computer architecture
Elastic scattering
Graphics processing units
Parallel processing
Online AccessGet full text

Cover

More Information
Summary:We present new algorithms for the parallelization of Eulerian-Lagrangian interaction operations in the immersed boundary method. Our algorithms rely on two well-studied parallel primitives: key-value sort and segmented reduce. The use of these parallel primitives allows us to implement our algorithms on both graphics processing units (GPUs) and on other shared memory architectures. We present strong and weak scaling tests on problems involving scattered points and elastic structures. Our tests show that our algorithms exhibit near-ideal scaling on both multicore CPUs and GPUs.
ISSN:2331-8422