PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 22, 2026RAS Techniques and Instruments0 citationsOpen Access

Task-Parallelism in SWIFT for Heterogeneous Compute Architectures

View Full Paper
ANAbouzied NasarBRBenedict D. RogersGFGeorgios Fourtakas

Key Points

  • The aim is to enable GPU acceleration of the SWIFT SPH solver by leveraging task-parallelism for efficiency.
  • Developed novel algorithms for GPU and CPU collaboration in SPH simulations.
  • Validated approaches through extensive performance testing on the Grace-Hopper superchip.
  • Analyzed the performance benefits in terms of speed and energy efficiency.
  • Achieved up to 7.5 times speedup in computations excluding data transfer times.
  • Delivered 1.8 times faster overall performance compared to CPU-only capabilities.
  • Increased particle update rate to 15 million updates per second for GPU-accelerated processes.
  • Demonstrated 29% improvement in energy efficiency compared to CPU-only baselines.

Abstract

Abstract This paper highlights first steps towards enabling graphics processing unit (GPU) acceleration of the task-parallel smoothed particle hydrodynamics (SPH) solver SWIFT. Novel combinations of algorithms are presented, enabling SWIFT to function as a truly heterogeneous software leveraging task-parallelism on CPUs for memory-bound computations concurrently with GPUs for compute-bound computations while minimising the effects of CPU-GPU communication latency. The proposed algorithms are validated in extensive testing. The GPU acceleration methodology is shown to deliver up to ∼3.5 and ∼7.5 speedups for the offloaded computations when including and excluding the time required to prepare and post-process data transfers on the CPU side, respectively. The overall performance of the GPU-accelerated hydrodynamic solver for a full simulation on a single Grace-Hopper superchip is 1.8 times faster compared to the superchip’s fully parallelised CPU capabilities. This constitutes an improvement from ∼8 million particle updates/s for the full CPU-only baseline (∼115’000 updates per CPU core) to ∼15 million updates/s for the GPU-accelerated SPH solver. Moreover, it displays near-perfect strong scaling on 4 Grace-Hopper nodes. The GPU-acceleration is also demonstrated to give a 29% improvement in energy efficiency in comparison to CPU-only baselines. Finally, inter-influential bottlenecks in the prototype solver presented in this work are identified: A significant amount of time (up to 80%) of a GPU-offloading cycle is spent on preparing and post-processing particle data on the CPU for the transfer to and from the GPU, respectively. Approaches are suggested to minimise their effects and maximise the solver’s performance in our future work.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Nasar et al. (2026) studied this question.

synapsesocial.com/papers/6971bea8642b1836717e3613https://doi.org/10.1093/rasti/rzag008
Ask AI
Helpful
Bookmark
Share
View Full Paper