EFFICIENT AND SCALABLE ALGORITHMS FOR SMOOTHED PARTICLE HYDRODYNAMICS ON HYBRID SHARED/DISTRIBUTED-MEMORY ARCHITECTURES.

Saved in:
Bibliographic Details
Title: EFFICIENT AND SCALABLE ALGORITHMS FOR SMOOTHED PARTICLE HYDRODYNAMICS ON HYBRID SHARED/DISTRIBUTED-MEMORY ARCHITECTURES.
Authors: GONNET, PEDRO1 gonnet@google.com
Source: SIAM Journal on Scientific Computing. 2015, Vol. 37 Issue 1, pC95-C121. 27p.
Subjects: Hydrodynamics, Hierarchical Bayes model, Hybrid computers (Computer architecture), Multiresolution time-domain method, Simulation methods & models
Abstract: This paper describes a new fast and implicitly parallel approach to neighbor-finding in multiresolution smoothed particle hydrodynamics (SPH) simulations. This new approach is based on hierarchical cell decompositions and sorted interactions, within a task-based formulation. It is shown to be faster than traditional tree-based codes and to scale better than domain decomposition-based approaches on hybrid shared/distributed-memory parallel architectures, e.g., clusters of multicores, achieving a 40x speedup over the Gadget-2 simulation code. [ABSTRACT FROM AUTHOR]
Copyright of SIAM Journal on Scientific Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:This paper describes a new fast and implicitly parallel approach to neighbor-finding in multiresolution smoothed particle hydrodynamics (SPH) simulations. This new approach is based on hierarchical cell decompositions and sorted interactions, within a task-based formulation. It is shown to be faster than traditional tree-based codes and to scale better than domain decomposition-based approaches on hybrid shared/distributed-memory parallel architectures, e.g., clusters of multicores, achieving a 40x speedup over the Gadget-2 simulation code. [ABSTRACT FROM AUTHOR]
ISSN:10648275
DOI:10.1137/140964266