Issue |
ESAIM: ProcS
Volume 45, September 2014
Congrès SMAI 2013
|
|
---|---|---|
Page(s) | 349 - 358 | |
DOI | https://doi.org/10.1051/proc/201445036 | |
Published online | 13 November 2014 |
Two-fluid compressible simulations on GPU cluster
1 IRMA, University of Strasbourg ;
helluy@math.unistra.fr
2 IRMA, University of Strasbourg ;
jonathan.jung@math.unistra.fr
In this work we propose an efficient finite volume approximation of two-fluid flows. Our scheme is based on three ingredients. We first construct a conservative scheme that removes the pressure oscillations phenomenon at the interface. The construction relies on a random sampling at the interface [5, 6]. Secondly, we replace the exact Riemann solver by a faster relaxation Riemann solver with good stability properties [4]. Finally, we apply Strang directional splitting and optimized memory transpositions in order to achieve high performance on Graphics Processing Unit (GPU) or GPU cluster computations.
Résumé
Nous proposons une méthode de volumes finis efficace pour l’approximation d’écoulements bifluides. Le schémas est basé sur trois ingrédients. Nous construisons d’abord un schéma conservatif sans oscillations de pression. La construction repose sur un échantillonnage aléatoire à l’interface. Ensuite, nous remplaçons le solveur de Riemann exact par un solveur approché de relaxation plus rapide, et qui possède de bonnes propriétés de stabilité. Finalement, nous appliquons un splitting directionnel de Strang et des techniques de transposition optimisées en mémoire pour atteindre de bonnes performances sur GPU ou cluster de GPU.
© EDP Sciences, SMAI 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.