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.

8th International SPHERIC Workshop, Trondheim, Norway, June 3--6, 2013

Cited by in corpus (6)

• Simulating cosmic structure formation with the GADGET-4 code
• SWIFT: Using task-based parallelism, fully asynchronous communication, and graph partition-based domain decomposition for strong scaling on more than 100,000 cores
• The moving mesh code Shadowfax
• Perfectly parallel cosmological simulations using spatial comoving Lagrangian acceleration
• SWIFT: Maintaining weak-scalability with a dynamic range of $10^4$ in time-step size to harness extreme adaptivity
• SWIFT: task-based hydrodynamics and gravity for cosmological simulations