pith. sign in

arxiv: 2202.11819 · v2 · pith:JHTPBU6Knew · submitted 2022-02-23 · 💻 cs.DC

Improving Scalability with GPU-Aware Asynchronous Tasks

classification 💻 cs.DC
keywords asynchronouscommunicationoverlapperformancetasksadditioncomputation-communicationfine-grained
0
0 comments X
read the original abstract

Asynchronous tasks, when created with over-decomposition, enable automatic computation-communication overlap which can substantially improve performance and scalability. This is not only applicable to traditional CPU-based systems, but also to modern GPU-accelerated platforms. While the ability to hide communication behind computation can be highly effective in weak scaling scenarios, performance begins to suffer with smaller problem sizes or in strong scaling due to fine-grained overheads and reduced room for overlap. In this work, we integrate GPU-aware communication into asynchronous tasks in addition to computation-communication overlap, with the goal of reducing time spent in communication and further increasing GPU utilization. We demonstrate the performance impact of our approach using a proxy application that performs the Jacobi iterative method, Jacobi3D. In addition to optimizations to minimize synchronizations between the host and GPU devices and increase the concurrency of GPU operations, we explore techniques such as kernel fusion and CUDA Graphs to mitigate fine-grained overheads at scale.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. BlackHoleWeather -- Jet-regulated chaotic cold accretion across the meso scale: Morphology and thermodynamics

    astro-ph.GA 2026-05 unverdicted novelty 6.0

    Hydrodynamical simulations show ambient turbulence strength controls jet-regulated condensation morphology and black-hole fueling efficiency in galaxy groups.