Abstract

Particle tracking within an underlying flow field is routinely used to analyse both industrial processes and natural phenomena. In a computer code running on a distributed-memory architecture, the different behaviour of fluid-particle systems must be taken into account to properly balance element-particle subdivision among processes. In unsteady simulations, the parallel efficiency is even more critical because it changes over time. Another challenging aspect of a scalable implementation is the initial particle location due to the arbitrary shapes of each subdomain. In this work, an innovative parallel ray tracing particle location algorithm and a two-constrained domain subdivision are presented. The former takes advantage of a global identifier for each particle, resulting in a significant reduction of the overall communication among processes. The latter is designed to mitigate the load unbalance in the particles evolution while maintaining an equal element distribution. A preliminary particle simulation is performed to tag the cells and compute a weight proportional to the probability to be crossed. The algorithm is implemented using MPI distribute memory environment. A cloud droplet impact test case starting from an unsteady flow around a 3D cylinder has been simulated to evaluate the code performances. The tagging technique results in a computational time reduction of up to 78% and a speed up factor improvement of 44% with respect to the common flow based domain subdivision. The overall scalability is equal to 1.55 doubling the number of cores.

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document
Back to Top
GET PDF

Document information

Published on 15/02/22
Submitted on 15/02/22

Volume IS02 - Advanced Particle Methods for Continuum Mechanics, 2022
DOI: 10.23967/particles.2021.007
Licence: CC BY-NC-SA license

Document Score

0

Views 27
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?