<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>GPGPU&#187;  :: GPGPU.org</title>
	<atom:link href="http://gpgpu.org/feed" rel="self" type="application/rss+xml" />
	<link>http://gpgpu.org</link>
	<description>General-Purpose Computation on Graphics Hardware</description>
	<lastBuildDate>Mon, 15 Mar 2010 01:06:51 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Pseudo-random number generators for Monte Carlo simulations on Graphics Processing Units</title>
		<link>http://gpgpu.org/2010/03/14/demchik-prng</link>
		<comments>http://gpgpu.org/2010/03/14/demchik-prng#comments</comments>
		<pubDate>Mon, 15 Mar 2010 01:06:51 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[ATI Stream]]></category>
		<category><![CDATA[Monte Carlo Simulation]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Random Number Generation]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=2194</guid>
		<description><![CDATA[Abstract:
Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU). The performance results of the realized generators (multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR, RANLUX and Mersenne Twister (MT19937)) on CPU and GPU are discussed. The obtained speed-up factor is hundreds of times in comparison with CPU. RANLUX generator is found [...]]]></description>
			<content:encoded><![CDATA[<p>Abstract:</p>
<blockquote><p>Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU). The performance results of the realized generators (multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR, RANLUX and Mersenne Twister (MT19937)) on CPU and GPU are discussed. The obtained speed-up factor is hundreds of times in comparison with CPU. RANLUX generator is found to be the most appropriate for using on GPU in Monte Carlo simulations. The brief review of the pseudo-random number generators used in modern software packages for Monte Carlo simulations in high-energy physics is present.</p></blockquote>
<p>(Vadim Demchik, <em>&#8220;Pseudo-random number generators for Monte Carlo simulations on Graphics Processing Units&#8221;</em>, Mar. 2010, <a href="1003.1898 [hep-lat]" target="_blank">arXiv:1003.1898 [hep-lat]</a>)</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2010/03/14/demchik-prng/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Call for Papers: META&#8217;10, Metaheuristics on GPUs</title>
		<link>http://gpgpu.org/2010/03/11/meta10</link>
		<comments>http://gpgpu.org/2010/03/11/meta10#comments</comments>
		<pubDate>Thu, 11 Mar 2010 14:07:45 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Events]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[Call for Papers]]></category>
		<category><![CDATA[Conferences]]></category>
		<category><![CDATA[Metaheuristics]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=2189</guid>
		<description><![CDATA[The 3rd International Conference on Metaheuristics and Nature Inspired Computing, META&#8217;10, features a special session on Metaheuristics on graphics hardware, organized by Geir Hasle and  Trond Runar Hagen. It focuses on the utilization of modern commodity computer architectures, in particular Graphics Processing Units (GPUs), to enhance the performance of metaheuristics. A broad spectrum of [...]]]></description>
			<content:encoded><![CDATA[<p>The 3rd International Conference on Metaheuristics and Nature Inspired Computing, META&#8217;10, features a special session on Metaheuristics on graphics hardware, organized by Geir Hasle and  Trond Runar Hagen. It focuses on the utilization of modern commodity computer architectures, in particular Graphics Processing Units (GPUs), to enhance the performance of metaheuristics. A broad spectrum of papers is invited, ranging from case studies focused on specific problems and applications to theoretical aspects and frameworks.</p>
<p>The conference will take place October 28-30, 2010, on Djerba Island, Tunisia. More information is available at the <a href="http://www2.lifl.fr/META10/" target="_blank">conference web page</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2010/03/11/meta10/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Symposium on Applications of Graphics  Processing Units (GPUs) in Chemistry  and Materials Science</title>
		<link>http://gpgpu.org/2010/03/11/symposium-pittsburg</link>
		<comments>http://gpgpu.org/2010/03/11/symposium-pittsburg#comments</comments>
		<pubDate>Thu, 11 Mar 2010 14:04:25 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Events]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[NVIDIA CUDA]]></category>
		<category><![CDATA[Tutorials & Courses]]></category>
		<category><![CDATA[Workshops]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=2187</guid>
		<description><![CDATA[This symposium is organized by the University of Pittsburgh&#8217;s Center for Simulation &#038; Modeling and Pittsburgh Supercomputing Center. The program includes a half-day hands-on tutorial, and several invited talks and presentations by experts from academia and industry. Registration is required. More information can be found at the symposium website.
]]></description>
			<content:encoded><![CDATA[<p>This symposium is organized by the University of Pittsburgh&#8217;s <a href="http://www.sam.pitt.edu/" target="_blank">Center for Simulation &#038; Modeling</a> and <a href="http://www.psc.edu/" target="_blank">Pittsburgh Supercomputing Center</a>. The program includes a half-day hands-on tutorial, and several invited talks and presentations by experts from academia and industry. Registration is required. More information can be found at the <a href="http://www.sam.pitt.edu/education/gpu2010.php" target="_blank">symposium website</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2010/03/11/symposium-pittsburg/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Yellow Dog Enterprise Linux for CUDA</title>
		<link>http://gpgpu.org/2010/03/09/yellow-dog-enterprise-linux-for-cuda</link>
		<comments>http://gpgpu.org/2010/03/09/yellow-dog-enterprise-linux-for-cuda#comments</comments>
		<pubDate>Wed, 10 Mar 2010 00:35:30 +0000</pubDate>
		<dc:creator>Mark Harris</dc:creator>
				<category><![CDATA[Business]]></category>
		<category><![CDATA[Developer Resources]]></category>
		<category><![CDATA[Linux]]></category>
		<category><![CDATA[NVIDIA CUDA]]></category>
		<category><![CDATA[Open Source]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=2185</guid>
		<description><![CDATA[Yellow Dog Enterprise Linux for CUDA (YDEL for CUDA) is an open source, Linux operating system built for faster, easier, and more reliable GPU Computing. YDEL for CUDA, released and supported by Fixstars, goes beyond the basic Linux OS and integrates support for GPUs, NVIDIA CUDA, and GPU development tools.
From the YDEL for CUDA website:
Key [...]]]></description>
			<content:encoded><![CDATA[<p>Yellow Dog Enterprise Linux for CUDA (YDEL for CUDA) is an open source, Linux operating system built for faster, easier, and more reliable GPU Computing. YDEL for CUDA, released and supported by <a href="http://www.fixstars.com/en/products/ydel/cuda/" target="_blank">Fixstars</a>, goes beyond the basic Linux OS and integrates support for GPUs, NVIDIA CUDA, and GPU development tools.</p>
<p>From the YDEL for CUDA website:</p>
<blockquote><p>Key benefits of Yellow Dog Enterprise Linux for CUDA:</p>
<ul>
<li>YDEL for CUDA users can experience up to a 9% performance improvement in some applications.</li>
<li>Comprehensive support is offered to paid subscriptions with our skilled team able to assist you with both Linux and CUDA.</li>
<li>YDEL&#8217;s unparalleled integrations means everything you need to write and run CUDA applications is included and configured.</li>
<li>YDEL includes multiple versions of CUDA and can easily switch between them via a setting in a configuration file or an environment variable.</li>
<li>Never worry about updates affecting your system, Fixstars offers YDEL users greater reliability with our strenuous test procedures that validate GPU computing functionality and performance.</li>
</ul>
</blockquote>
<p>For more information, visit the <a href="http://www.fixstars.com/en/products/ydel/cuda/" target="_blank">YDEL for CUDA website</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2010/03/09/yellow-dog-enterprise-linux-for-cuda/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CLyther = Python + OpenCL</title>
		<link>http://gpgpu.org/2010/03/09/clyther-python-opencl</link>
		<comments>http://gpgpu.org/2010/03/09/clyther-python-opencl#comments</comments>
		<pubDate>Tue, 09 Mar 2010 22:17:29 +0000</pubDate>
		<dc:creator>Mark Harris</dc:creator>
				<category><![CDATA[Developer Resources]]></category>
		<category><![CDATA[Open Source]]></category>
		<category><![CDATA[OpenCL]]></category>
		<category><![CDATA[Programming Languages]]></category>
		<category><![CDATA[Python]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=2183</guid>
		<description><![CDATA[CLyther is an under-development python tool for OpenCL similar to Cython for C. CLyther is a python language extension intended to make writing OpenCL code as easy as Python itself. CLyther currently only supports a subset of the Python language definition but adds many new features for OpenCL.
CLyther exposes both the OpenCL C library and language [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://clyther.sourceforge.net/">CLyther </a>is an under-development python tool for OpenCL similar to Cython for C. CLyther is a python language extension intended to make writing OpenCL code as easy as Python itself. CLyther currently only supports a subset of the Python language definition but adds many new features for OpenCL.</p>
<p>CLyther exposes both the OpenCL C library and language to python. It&#8217;s features include:</p>
<ul>
<li>Fast prototyping of OpenCL code.</li>
<li>OpenCL kernel function creation using the Python language definition.</li>
<li>Strong OOP programming in OpenCL code.</li>
<li>Passing functions as arguments to kernel functions.</li>
<li>Python emulation mode for OpenCL code.</li>
<li>Fancy indexing of arrays.</li>
<li>Dynamic compilation at runtime.</li>
</ul>
<p><span id="more-2183"></span><br />
CLyther is currently under development, and the developers plan to release a beta version before April 14. They are looking for feedback and developers to help with this project. If you are interested, post a comment to the CLyther <a href="https://sourceforge.net/projects/clyther/forums/forum/1096292/topic/3562356">forum</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2010/03/09/clyther-python-opencl/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>PASCO 2010: Call for Papers</title>
		<link>http://gpgpu.org/2010/03/09/pasco-2010</link>
		<comments>http://gpgpu.org/2010/03/09/pasco-2010#comments</comments>
		<pubDate>Tue, 09 Mar 2010 22:08:33 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Events]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[Call for Papers]]></category>
		<category><![CDATA[Computer Algebra]]></category>
		<category><![CDATA[Numerics]]></category>
		<category><![CDATA[Symbolic Computations]]></category>
		<category><![CDATA[Workshops]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=2176</guid>
		<description><![CDATA[The International Workshop on Parallel and Symbolic Computation (PASCO) is a series of workshops dedicated to the promotion and advancement of parallel algorithms and software in all areas of symbolic mathematical computation. The pervasive ubiquity of parallel architectures and memory hierarchy has led to  the emergence of a new quest for parallel mathematical algorithms [...]]]></description>
			<content:encoded><![CDATA[<p>The International Workshop on Parallel and Symbolic Computation (PASCO) is a series of workshops dedicated to the promotion and advancement of parallel algorithms and software in all areas of symbolic mathematical computation. The pervasive ubiquity of parallel architectures and memory hierarchy has led to  the emergence of a new quest for parallel mathematical algorithms and software capable of exploiting the various levels of parallelism: from hardware acceleration technologies (multi-core and multi-processor system on chip, GPGPU, FPGA) to cluster and global computing platforms. To  push up the limits of symbolic and algebraic computations, beyond the optimization of the application itself, the effective use of a large number of  resources  -memory and general or specialized computing units- is expected to enhance the performance multi-criteria objectives: time, energy consumption, resource usage, reliability. In this context, the design and the implementation of mathematical algorithms with  provable and adaptive performances is a major challenge.</p>
<p>The  workshop  PASCO 2010 will be a three-day event  including  invited presentations and tutorials, contributed research papers and posters, and a programming contest. Specific topics include, but are not limited to:<span id="more-2176"></span></p>
<ul>
<li>Design and analysis of parallel algorithms for computer algebra</li>
<li>Practical parallel implementation of symbolic or symbolic-numeric algorithms</li>
<li>High-performance software tools and libraries for computer algebra</li>
<li>Applications of high-performance computer algebra</li>
<li>Distributed data-structures for computer algebra</li>
<li>Hardware acceleration technologies (multi-cores, GPUs, FPGAs) applied to computer algebra</li>
<li>Cache complexity and cache-oblivious algorithms for computer algebra</li>
<li>Compile-time and run-time techniques for automating optimization and platform adaptation of computer algebra algorithms</li>
</ul>
<p>The  conference  invites submission of papers presenting original research, either in the form of extended abstracts (2 pages) or full papers (up to 10 pages) in ACM format. As in previous years, PASCO 2010 will publish formal proceedings of the accepted papers. Please refer to the <a href="http://pasco2010.imag.fr/" target="_blank">conference web site</a> for details, important dates, and the programming contest.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2010/03/09/pasco-2010/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Swan: A simple tool for porting CUDA to OpenCL</title>
		<link>http://gpgpu.org/2010/03/09/swan</link>
		<comments>http://gpgpu.org/2010/03/09/swan#comments</comments>
		<pubDate>Tue, 09 Mar 2010 22:07:45 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Developer Resources]]></category>
		<category><![CDATA[NVIDIA CUDA]]></category>
		<category><![CDATA[OpenCL]]></category>
		<category><![CDATA[Tools]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=2178</guid>
		<description><![CDATA[Swan is a small tool that aids the reversible conversion of existing CUDA codebases to OpenCL. Its main features are the translation of CUDA kernel source-code to OpenCL, and a common API that abstracts both CUDA and OpenCL runtimes. Swan preserves the convenience of the CUDA &#60;&#60;&#60; grid, block &#62;&#62;&#62; kernel launch syntax by generating [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.multiscalelab.org/swan" target="_blank">Swan</a> is a small tool that aids the reversible conversion of existing CUDA codebases to OpenCL. Its main features are the translation of CUDA kernel source-code to OpenCL, and a common API that abstracts both CUDA and OpenCL runtimes. Swan preserves the convenience of the CUDA &lt;&lt;&lt; grid, block &gt;&gt;&gt; kernel launch syntax by generating C source-code for kernel entry-point functions. Possible uses include:</p>
<ul>
<li>Evaluating OpenCL performance of an existing CUDA code</li>
<li>Maintaining a dual-target OpenCL and CUDA code</li>
<li>Reducing dependence on NVCC when compiling host code</li>
<li>Support multiple CUDA compute capabilities in a single binary</li>
</ul>
<p><a href="http://www.multiscalelab.org/swan" target="_blank">Swan</a> is developed by the <a href="http://www.multiscalelab.org/" target="_blank">MultiscaleLab, Barcelona</a>, and is available under the GPL2 license.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2010/03/09/swan/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Cyclic Reduction Tridiagonal Solvers on GPUs Applied to Mixed Precision Multigrid</title>
		<link>http://gpgpu.org/2010/03/03/cyclic-reduction-multigrid</link>
		<comments>http://gpgpu.org/2010/03/03/cyclic-reduction-multigrid#comments</comments>
		<pubDate>Wed, 03 Mar 2010 06:30:37 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[Numerics]]></category>
		<category><![CDATA[NVIDIA CUDA]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Parallel Algorithms]]></category>
		<category><![CDATA[Scientific Computing]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=2171</guid>
		<description><![CDATA[Abstract:
We have previously suggested mixed precision iterative solvers specifically tailored to the iterative solution of sparse linear equation systems as they typically arise in the finite element discretization of partial differential equations. These schemes have been evaluated for a number of hardware platforms, in particular single precision GPUs as accelerators to the general purpose CPU. [...]]]></description>
			<content:encoded><![CDATA[<p>Abstract:</p>
<blockquote><p>We have previously suggested mixed precision iterative solvers specifically tailored to the iterative solution of sparse linear equation systems as they typically arise in the finite element discretization of partial differential equations. These schemes have been evaluated for a number of hardware platforms, in particular single precision GPUs as accelerators to the general purpose CPU. This paper reevaluates the situation with new mixed precision solvers that run entirely on the GPU: We demonstrate that mixed precision schemes constitute a significant performance gain over native double precision. Moreover, we present a new implementation of cyclic reduction for the parallel solution of tridiagonal systems and employ this scheme as a line relaxation smoother in our GPU-based multigrid solver. With an alternating direction implicit variant of this advanced smoother we can extend the applicability of the GPU multigrid solvers to very ill-conditioned systems arising from the discretization on anisotropic meshes, that previously had to be solved on the CPU. The resulting mixed precision schemes are always faster than double precision alone, and outperform tuned CPU solvers consistently by almost an order of magnitude.</p></blockquote>
<p>(Dominik Göddeke and Robert Strzodka: <em>&#8220;Cyclic Reduction Tridiagonal Solvers on GPUs Applied to Mixed Precision Multigrid&#8221;</em> , accepted in: IEEE Transactions on Parallel and Distributed Systems, Special Issue: High Performance Computing with Accelerators, Mar. 2010. <a href="http://www.mathematik.tu-dortmund.de/~goeddeke/pubs/index.html#Goeddeke_2010_CRT" target="_blank">Link</a>.)</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2010/03/03/cyclic-reduction-multigrid/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Easy GPU programming with GMAC</title>
		<link>http://gpgpu.org/2010/03/01/easy-gpu-programming-with-gmac</link>
		<comments>http://gpgpu.org/2010/03/01/easy-gpu-programming-with-gmac#comments</comments>
		<pubDate>Mon, 01 Mar 2010 22:58:38 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Developer Resources]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[Libraries]]></category>
		<category><![CDATA[NVIDIA CUDA]]></category>
		<category><![CDATA[Open Source]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Tools]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=2166</guid>
		<description><![CDATA[GMAC (Global Memory for ACcelerators) is a user-level library that implements an Asymmetric Distributed Shared Memory model to be used by CUDA programs. An ADSM model allows CPU code to access data hosted in accelerator (GPU) memory. In this model, a single pointer is used for data structures accessed both in the CPU and the [...]]]></description>
			<content:encoded><![CDATA[<p>GMAC (Global Memory for ACcelerators) is a user-level library that implements an Asymmetric Distributed Shared Memory model to be used by CUDA programs. An ADSM model allows CPU code to access data hosted in accelerator (GPU) memory. In this model, a single pointer is used for data structures accessed both in the CPU and the GPU and the coherency of the data is transparently handled by the library. Moreover, the data allocated with GMAC can be accessed by all the host threads of the program. That makes your code simpler and cleaner. GMAC currently supports programs programmed with CUDA, but OpenCL support is planned.</p>
<p>A paper describing the Asymmetric Distributed Shared Memory model and its implementation in GMAC has been accepted in the ASPLOS XV conference. GMAC is being developed by the Operating System Group at the Universitat Politecnica de Catalunya and the IMPACT Research Group at the University of Illinois. Binary pre-compiled packages, the source code, documentation and examples are available at the <a href="http://code.google.com/p/adsm/" target="_blank">project website</a>.</p>
<p>(Isaac Gelado, Javier Cabezas, John Stone, Sanjay Patel, Nacho Navarro and Wen-mei Hwu,  <em>&#8220;An Asymmetric Distributed Shared Memory Model for Heterogeneous Parallel Systems&#8221;</em>, accepted in: <a href="http://www.ece.cmu.edu/CALCM/asplos10/doku.php" target="_blank">Fifteenth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2010)</a>, March 2010.)</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2010/03/01/easy-gpu-programming-with-gmac/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Lattice-Boltzmann Simulation of the Shallow-Water Equations with Fluid-Structure Interaction on Multi- and Manycore Processors</title>
		<link>http://gpgpu.org/2010/02/28/lattice-boltzmann-shallow-water-equations</link>
		<comments>http://gpgpu.org/2010/02/28/lattice-boltzmann-shallow-water-equations#comments</comments>
		<pubDate>Mon, 01 Mar 2010 00:17:49 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[Cell BE]]></category>
		<category><![CDATA[Fluid Simulation]]></category>
		<category><![CDATA[Multicore]]></category>
		<category><![CDATA[NVIDIA CUDA]]></category>
		<category><![CDATA[Papers]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=2162</guid>
		<description><![CDATA[Abstract:
We present an efficient method for the simulation of laminar fluid flows with free surfaces including their interaction with moving rigid bodies, based on the two-dimensional shallow water equations and the Lattice-Boltzmann method. Our implementation targets multiple fundamentally different architectures such as commodity multicore CPUs with SSE, GPUs, the Cell BE and clusters. We show [...]]]></description>
			<content:encoded><![CDATA[<p>Abstract:</p>
<blockquote><p>We present an efficient method for the simulation of laminar fluid flows with free surfaces including their interaction with moving rigid bodies, based on the two-dimensional shallow water equations and the Lattice-Boltzmann method. Our implementation targets multiple fundamentally different architectures such as commodity multicore CPUs with SSE, GPUs, the Cell BE and clusters. We show that our code scales well on an MPI-based cluster; that an eightfold speedup can be achieved using modern GPUs in contrast to multithreaded CPU code and, finally, that it is possible to solve fluid-structure interaction scenarios with high resolution at interactive rates.</p></blockquote>
<p>(Markus Geveler, Dirk Ribbrock, Dominik Göddeke and Stefan Turek: <em>&#8220;Latti</em><em>ce-Boltzmann Simulation of the Shallow-Water Equations with Fluid-Structure Interaction on Multi- and Manycore Processors&#8221;</em>, Accepted in: Facing the Multicore Challenge, Heidelberg, Germany, Mar. 2010. <a href="http://www.mathematik.tu-dortmund.de/~goeddeke/pubs/index.html#Geveler_2010_LBS" target="_blank">Link</a>.)</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2010/02/28/lattice-boltzmann-shallow-water-equations/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
