SWIFT: Fast algorithms for multi-resolution SPH on multi-core architectures

Gonnet, P.; Schaller, M.; Theuns, T.; Chalk, A.B.G.

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.

Citation

Gonnet, P., Schaller, M., Theuns, T., & Chalk, A. (2013). SWIFT: Fast algorithms for multi-resolution SPH on multi-core architectures.

• Conference Name: 8th International SPHERIC Workshop
• Conference Location: Trondheim, Norway
• Publication Date: 2013
• Deposit Date: Jun 19, 2013
• Publisher URL: https://www.dur.ac.uk/pedro.gonnet/wp-content/uploads/2013/03/paper.pdf