SWIFT: Fast algorithms for multi-resolution SPH on multi-core architectures
Abstract
This paper describes a novel approach to neighbour-finding in Smoothed Particle Hydrodynamics (SPH) simulations with large dynamic range in smoothing length. This approach is based on hierarchical cell decompositions, sorted interactions, and 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 shared-memory parallel architectures such as multi-cores.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2013
- DOI:
- 10.48550/arXiv.1309.3783
- arXiv:
- arXiv:1309.3783
- Bibcode:
- 2013arXiv1309.3783G
- Keywords:
-
- Astrophysics - Instrumentation and Methods for Astrophysics;
- Astrophysics - Cosmology and Extragalactic Astrophysics;
- Computer Science - Distributed;
- Parallel;
- and Cluster Computing
- E-Print:
- 8th International SPHERIC Workshop, Trondheim, Norway, June 3--6, 2013