DCMSPFJun 22

Memory Layouts for GPU-Data Transfer Buffering in SPH

arXiv:2606.238917.5
Predicted impact top 43% in DC · last 90 daysOriginality Incremental advance
AI Analysis

For developers of GPU-accelerated SPH codes, this work offers practical layout optimizations to mitigate growing memory transfer overheads.

The paper addresses the bottleneck of host-to-device memory transfer in GPU computing by proposing memory layout strategies for Smoothed Particle Hydrodynamics solvers, achieving a 12-25% reduction in total GPU-offloading time.

The rise in GPU compute speed has outpaced improvements in host-to-device memory transfer speeds, despite the advent of shared-memory superchips. Consequently, memory transfer times now constitute an increasingly large fraction of total time-to-solution, compelling developers to compress GPU kernel input and output data into compact, minimal formats prior to GPU-offloading. This complements existing work on GPU- and compute-friendly data arrangements. We study a Smoothed Particle Hydrodynamics solver and propose memory layout strategies for host-side particle data that are particularly well-suited to GPU-offloading. Specifically, we advocate splitting classic array-of-struct data structures into a split array-of-struct arrangement, in which each logical struct decomposes into substructs determined by kernel read/write access patterns and attribute types. Splitting a monolithic particle struct into several bespoke, finer-grained structs can reduce the time required to pack data to and from buffers by ~20% - 40%, lowering total time spent on GPU-offloading by ~12% - 25%.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes