Presentation

· Contributors · Organizations · Search Program · My Schedule · Happening Now · Maps

This content is available for: Workshop Reg Pass. Upgrade Registration

Comparing a Naive and a Tree-Based N-Body Algorithm Using Different Standard SYCL Implementations on Various Hardware

SessionTenth Workshop on Accelerator Programming and Directives (WACCPD 2023)

DescriptionN-body algorithms aim to calculate the interactions between n different bodies with the goal to obtain their trajectories. Algorithms that solve the n-body problem can leverage significant amounts of parallelism. Today, GPUs are commonly used besides CPUs for the execution of parallel algorithms. However, targeting several hardware platforms at once often requires to use different programming languages. In this work, we have implemented the naive and tree-based Barnes-Hut n-body algorithm using SYCL to target CPUs and GPUs with the same programming language. We compare both algorithms on heterogeneous hardware platforms as well as for different SYCL implementations, with respect to their runtime behavior and their support for several performance optimizations. Our results show that some optimizations show unexpected behavior for different SYCL implementations. And even though data center GPUs have a clear performance advantage for the naive algorithm, surprisingly consumer GPUs offer competitive runtimes for the Barnes-Hut algorithm.

Author/Presenters

Tim Thüring

University of Stuttgart