Efficient GPU Implementation of the Linearly Interpolated Bounce-Back Boundary Condition - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers & Mathematics with Applications Année : 2013

Efficient GPU Implementation of the Linearly Interpolated Bounce-Back Boundary Condition

C. Obrecht
Bernard Tourancheau

Résumé

Interpolated bounce-back boundary conditions for the lattice Boltzmann method (LBM) make the accurate representation of complex geometries possible. In the present work, we describe an implementation of a linearly interpolated bounce-back (LIBB) boundary condition for graphics processing units (GPUs). To validate our code, we simulated the flow past a sphere in a square channel. At low Reynolds numbers, results are in good agreement with experimental data. Moreover, we give an estimate of the critical Reynolds number for transition from steady to periodic flow. Performance recorded on a single node server with eight GPU based computing devices ranged up to 2.63×1092.63×109 fluid node updates per second. Comparison with a simple bounce-back version of the solver shows that the impact of LIBB on performance is fairly low.
Fichier principal
Vignette du fichier
ACL31.pdf (242.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00731150 , version 1 (09-06-2014)

Identifiants

Citer

C. Obrecht, F. Kuznik, Bernard Tourancheau, J.-J. Roux. Efficient GPU Implementation of the Linearly Interpolated Bounce-Back Boundary Condition. Computers & Mathematics with Applications, 2013, 65 (6), http://dx.doi.org/10.1016/j.camwa.2012.05.014. ⟨10.1016/j.camwa.2012.05.014⟩. ⟨hal-00731150⟩
89 Consultations
252 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More