ORBi: Dethier Gérard - Lattice Boltzmann Simulation Code Optimization Based on Constant-time Circular Array Shifting

Reference : Lattice Boltzmann Simulation Code Optimization Based on Constant-time Circular Array Shi...


	Document type :	Scientific congresses and symposiums : Paper published in a journal
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/2268/95940

Title :	Lattice Boltzmann Simulation Code Optimization Based on Constant-time Circular Array Shifting
Language :	English
Alternative title :	[fr] Optimisation de code de simulation Lattice Boltzmann basée sur le glissement en temps constant de tableaux circulaires
Author, co-author :	Dethier, Gérard [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Dép. d'électric., électron. et informat. (Inst.Montefiore) >]
	de Marneffe, Pierre-Arnoul [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Dép. d'électric., électron. et informat. (Inst.Montefiore) >]
	Marchot, Pierre [Université de Liège - ULg > Département de chimie appliquée > Génie chimique - Systèmes polyphasiques >]
Publication date :	2011
Journal title :	Procedia Computer Science
Publisher :	Elsevier
Volume :	4
Special issue title :	Proceedings of the International Conference on Computational Science, ICCS 2011
Pages :	1004-1013
On invitation :	No
Audience :	International
ISSN :	1877-0509
Event name :	International Conference on Computational Science, ICCS 2011
Event date :	1-3 juin 2011
Event place (city) :	Singapour
Event country :	Singapour
Keywords :	[en] Lattice Boltzmann ; Simulation ; Optimization ; Algorithmics
Abstract :	[en] Lattice Boltzmann (LB) methods are a class of Computational Fluid Dynamics (CFD) methods for fluid flow simulation. LB simulation codes have high requirements regarding memory and computational power: they may involve the update of several millions of floating point values thousands of times and therefore require several gigabytes of available memory and run for several days. Optimized implementations of LB methods minimize these requirements. An existing method based on a particular data layout and an associated implementation implying a constant time array shifting allows to reduce the execution time of LB simulations and almost minimize memory usage when compared to a naive implementation. In this paper, we show that this method can be further improved, both in memory usage and performances by slightly modifying the data layout and by using blocking in order to enhance data locality.
Target :	Researchers
Permalink :	http://hdl.handle.net/2268/95940
DOI :	10.1016/j.procs.2011.04.106

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	iccs2011-dethier-paper.pdf		Author preprint	382.63 kB	View/Open

All documents in ORBi are protected by a user license.

Dspace v1.5