Contiguous Storage of Grid Data for Heterogeneous Computing
Fan Gu, Xiangyu Hu
TL;DR
This work delivers a GPU-friendly, SYCL-based sparse-grid storage architecture tailored for heterogeneous computing. By introducing MeshWithGridDataPackages, array-based data layouts, neighborhood indexing, and a unified execution model, it achieves improved portability and scalability for sparse-grid and grid-particle simulations. Key contributions include a concurrent, device-agnostic kernel framework, multi-resolution level-set construction, and GPU-accelerated level-set cleaning and SPH coupling, yielding memory savings and performance gains over CPU-optimized baselines. The approach promises easier end-user adoption and better performance on modern heterogeneous hardware for complex simulations that rely on sparse grids and level-set methods.
Abstract
Structured Cartesian grids are a fundamental component in numerical simulations. Although these grids facilitate straightforward discretization schemes, their naïve use in sparse domains leads to excessive memory overhead and inefficient computation. Existing frameworks address are primarily optimized for CPU execution and exhibit performance bottlenecks on GPU architectures due to limited parallelism and high memory access latency. This work presents a redesigned storage architecture optimized for GPU compatibility and efficient execution across heterogeneous platforms. By abstracting low-level GPU-specific details and adopting a unified programming model based on SYCL, the proposed data structure enables seamless integration across host and device environments. This architecture simplifies GPU programming for end-users while improving scalability and portability in sparse-grid and gird-particle coupling numerical simulations.
