Compressed Neighbour Lists for SPH
Open Access
- 26 November 2019
- journal article
- research article
- Published by Wiley in Computer Graphics Forum
- Vol. 39 (1) , 531-542
Abstract
We propose a novel compression scheme to store neighbour lists for iterative solvers that employ Smoothed Particle Hydrodynamics (SPH). The compression scheme is inspired by Stream VByte, but uses a non‐linear mapping from data to data bytes, yielding memory savings of up to 87%. It is part of a novel variant of the Cell‐Linked‐List (CLL) concept that is inspired by compact hashing with an improved processing of the cell‐particle relations. We show that the resulting neighbour search outperforms compact hashing in terms of speed and memory consumption. Divergence‐Free SPH (DFSPH) scenarios with up to 1.3 billion SPH particles can be processed on a 24‐core PC using 172 GB of memory. Scenes with more than 7 billion SPH particles can be processed in a Message Passing Interface (MPI) environment with 112 cores and 880 GB of RAM. The neighbour search is also useful for interactive applications. A DFSPH simulation step for up to 0.2 million particles can be computed in less than 40 ms on a 12‐core PC.Keywords
This publication has 58 references indexed in Scilit:
- Neighbour lists in smoothed particle hydrodynamicsInternational Journal for Numerical Methods in Fluids, 2010
- A Parallel SPH Implementation on Multi‐Core CPUsComputer Graphics Forum, 2010
- Index compression using 64‐bit wordsSoftware: Practice and Experience, 2010
- Defining and optimizing algorithms for neighbouring particle identification in SPH fluid simulationsInternational Journal for Numerical Methods in Fluids, 2008
- Parallel load‐balanced simulation for short‐range interaction particle methods with hierarchical particle grouping based on orthogonal recursive bisectionInternational Journal for Numerical Methods in Engineering, 2007
- Adaptively sampled particle fluidsACM Transactions on Graphics, 2007
- Efficient permutation instructions for fast software cryptographyIEEE Micro, 2001
- A portable parallel particle programComputer Physics Communications, 1995
- Program design for retrospective searches on large data basesInformation Storage and Retrieval, 1972
- Ueber die stetige Abbildung einer Line auf ein Fl chenst ckMathematische Annalen, 1891