Potential benefits of a block-space GPU approach for discrete tetrahedral domains
Crist\'obal A. Navarro, Benjam\'in Bustos, Nancy Hitschfeld

TL;DR
This paper investigates a combined data re-organization and block-space GPU mapping approach for tetrahedral domains, showing potential for significant performance improvements in GPU computations on non-box-shaped spatial data.
Contribution
It introduces a novel combination of succinct data re-organization and an efficient block-space GPU map tailored for tetrahedral domains, demonstrating theoretical performance gains.
Findings
Up to 2x performance improvement with data re-organization.
Up to 6x efficiency gain over bounding box methods.
Reduction of unnecessary threads from O(n^3) to O(n^2 ho^3).
Abstract
The study of data-parallel domain re-organization and thread-mapping techniques are relevant topics as they can increase the efficiency of GPU computations when working on spatial discrete domains with non-box-shaped geometry. In this work we study the potential benefits of applying a succint data re-organization of a tetrahedral data-parallel domain of size combined with an efficient block-space GPU map of the form . Results from the analysis suggest that in theory the combination of these two optimizations produce significant performance improvement as block-based data re-organization allows a coalesced one-to-one correspondence at local thread-space while produces an efficient block-space spatial correspondence between groups of data and groups of threads, reducing the number of unnecessary threads from …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
