GPU-Native Compressed Neighbor Lists with a Space-Filling-Curve Data Layout
Felix Thaler, Sebastian Keller

TL;DR
This paper introduces a GPU-efficient, compressed neighbor list using space-filling curves that supports high-density contrast systems and integrates seamlessly with octree-based methods, enabling scalable astrophysical simulations.
Contribution
The paper presents a novel GPU-native compressed neighbor list with a space-filling-curve layout supporting variable radii, optimized for high-density contrast systems and compatible with octree methods.
Findings
Achieves 4 bytes per particle memory footprint for ~200 neighbors
Performs comparably to GROMACS neighbor list in molecular dynamics
Successfully simulates Evrard collapse on 1024 GPUs with accurate results
Abstract
We have developed a compressed neighbor list for short-range particle-particle interaction based on a space- filling curve (SFC) memory layout and particle clusters. The neighbor list can be constructed efficiently on GPUs, supporting NVIDIA and AMD hardware, and has a memory footprint of only 4 bytes per particle to store approximately 200 neighbors. Compared to the highly-optimized domain-specific neighbor list implementation of GROMACS, a molecular dynamics code, it has a comparable cluster overhead and delivers similar performance in a neighborhood pass. Thanks to the SFC-based data layout and the support for varying interaction radii per particle, our neighbor list performs well for systems with high density contrasts, such as those encountered in many astrophysical and cosmological applications. Due to the close relation between SFCs and octrees, our neighbor list seamlessly…
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.
Taxonomy
TopicsProtein Structure and Dynamics · Fluid Dynamics Simulations and Interactions · Parallel Computing and Optimization Techniques
