A Parallel SPH Implementation on Multi-Core CPUs

Simple item page
dc.contributor.authorIhmsen, Markusen_US
dc.contributor.authorAkinci, Nadiren_US
dc.contributor.authorBecker, Markusen_US
dc.contributor.authorTeschner, Matthiasen_US
dc.contributor.editorEduard Groeller and Holly Rushmeieren_US
dc.date.accessioned2015-02-27T10:19:10Z
dc.date.available2015-02-27T10:19:10Z
dc.date.issued2011en_US
dc.description.abstractThis paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient parallel neighbourhood queries are proposed and compared. To further minimize the computing time for entire simulation sequences, strategies for maximizing the time step and the respective consequences for parallel implementations are investigated. The presented experiments illustrate that the parallel framework can efficiently compute large numbers of time steps for large scenarios. In the context of neighbourhood queries, the paper presents optimizations for two efficient instances of uniform grids, that is, spatial hashing and index sort. For implementations on parallel architectures with shared memory, the paper discusses techniques with improved cache-hit rate and reduced memory transfer. The performance of the parallel implementations of both optimized data structures is compared. The proposed solutions focus on systems with multiple CPUs. Benefits and challenges of potential GPU implementations are only briefly discussed.en_US
dc.description.number1
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume30
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2010.01832.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleA Parallel SPH Implementation on Multi-Core CPUsen_US
Files
Collections
30-Issue 1