<?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; Category: Research :: GPGPU.org</title>
	<atom:link href="http://gpgpu.org/category/research/feed" rel="self" type="application/rss+xml" />
	<link>http://gpgpu.org</link>
	<description>General-Purpose Computation on Graphics Hardware</description>
	<lastBuildDate>Mon, 06 Feb 2012 04:59:24 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>GPU and APU computations of Finite Time Lyapunov Exponent fields</title>
		<link>http://gpgpu.org/2012/02/01/lyapunov-exponent-fields</link>
		<comments>http://gpgpu.org/2012/02/01/lyapunov-exponent-fields#comments</comments>
		<pubDate>Wed, 01 Feb 2012 07:00:09 +0000</pubDate>
		<dc:creator>Mark Harris</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[APU]]></category>
		<category><![CDATA[Fluid Simulation]]></category>
		<category><![CDATA[OpenCL]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=4433</guid>
		<description><![CDATA[We present GPU and APU accelerated computations of Finite-Time Lyapunov Exponent (FTLE) fields. The calculation of FTLEs is a computationally intensive process, as in order to obtain the sharp ridges associated with the Lagrangian Coherent Structures an extensive resampling of the flow field is required. The computational performance of this resampling is limited by the [...]]]></description>
			<content:encoded><![CDATA[<p>We present GPU and APU accelerated computations of Finite-Time Lyapunov Exponent (FTLE) fields. The calculation of FTLEs is a computationally intensive process, as in order to obtain the sharp ridges associated with the Lagrangian Coherent Structures an extensive resampling of the flow field is required. The computational performance of this resampling is limited by the memory bandwidth of the underlying computer architecture. The present technique harnesses data-parallel execution of many-core architectures and relies on fast and accurate evaluations of moment conserving functions for the mesh to particle interpolations. We demonstrate how the computation of FTLEs can be efficiently performed on a GPU and on an APU through OpenCL and we report over one order of magnitude improvements over multi-threaded executions in FTLE computations of bluff body flows. (Conti C., Rossinelli D., Koumoutsakos P., <em><a href="http://www.sciencedirect.com/science/article/pii/S0021999111006322">GPU and APU computations of Finite Time Lyapunov Exponent fields</a></em>, Journal of Computational Physics, 231(5):2229–2244, 2012.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2012/02/01/lyapunov-exponent-fields/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Submit your poster to GTC 2012 by February 2nd!</title>
		<link>http://gpgpu.org/2012/01/25/gtc2012-poster-deadline</link>
		<comments>http://gpgpu.org/2012/01/25/gtc2012-poster-deadline#comments</comments>
		<pubDate>Wed, 25 Jan 2012 06:02:10 +0000</pubDate>
		<dc:creator>Mark Harris</dc:creator>
				<category><![CDATA[Events]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[Call for Papers]]></category>
		<category><![CDATA[Conferences]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=4414</guid>
		<description><![CDATA[Reminder: the deadline to submit a research poster for this year’s GPU Technology Conference is Thursday, February 2, 2012. Selected poster presenters receive a discount to attend GTC. They are required to attend the conference in order to present their work at the GTC Poster Showcase.   GTC will be held May 14-17 in San [...]]]></description>
			<content:encoded><![CDATA[<p>Reminder: the deadline to submit a research poster for this year’s GPU Technology Conference is <strong>Thursday, February 2, 2012</strong>. Selected poster presenters receive a discount to attend GTC. They are required to attend the conference in order to present their work at the GTC Poster Showcase.   GTC will be held May 14-17 in San Jose, California.  For more information, see the <a href="http://www.gputechconf.com/page/participate.html" target="_blank">call for participation</a> and <a href="http://www.gputechconf.com/page/call-for-posters.html" target="_blank">call for posters</a>. To submit your poster abstract, visit  <a href="https://gtc-submissions.confreg.com/" target="_blank">https://gtc-submissions.confreg.com/</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2012/01/25/gtc2012-poster-deadline/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>PyCOOL: Python Cosmological Object-Oriented Lattice code</title>
		<link>http://gpgpu.org/2012/01/25/pycool</link>
		<comments>http://gpgpu.org/2012/01/25/pycool#comments</comments>
		<pubDate>Wed, 25 Jan 2012 05:03:45 +0000</pubDate>
		<dc:creator>Mark Harris</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[Astrophysics]]></category>
		<category><![CDATA[Cosmology]]></category>
		<category><![CDATA[NVIDIA CUDA]]></category>
		<category><![CDATA[Python]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=4411</guid>
		<description><![CDATA[PyCOOL (Cosmological Object-Oriented Lattice code) is a fast GPU accelerated program that solves the evolution of interacting scalar fields in an expanding universe with symplectic algorithms. The program has been written with the intention to hit a sweet spot of speed, accuracy and user friendliness. This is achieved by using the Python language with the  PyCUDA interface [...]]]></description>
			<content:encoded><![CDATA[<p>PyCOOL (Cosmological Object-Oriented Lattice code) is a fast GPU accelerated program that solves the evolution of interacting scalar fields in an expanding universe with symplectic algorithms. The program has been written with the intention to hit a sweet spot of speed, accuracy and user friendliness. This is achieved by using the Python language with the  <a href="http://mathema.tician.de/software/pycuda">PyCUDA</a> interface to make a program that is very easy to adapt to different scalar field models.  The program is <a href="https://github.com/jtksai/PyCOOL" target="_blank">publicly available</a> under GNU General Public License at. See the <a href="http://www.physics.utu.fi/tiedostot/theory/particlecosmology/pycool/" target="_blank">PyCOOL website</a> for more information.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2012/01/25/pycool/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Using GPUs to Accelerate Installed Antenna Performance Simulations</title>
		<link>http://gpgpu.org/2012/01/09/installed-antenna-performance-simulations</link>
		<comments>http://gpgpu.org/2012/01/09/installed-antenna-performance-simulations#comments</comments>
		<pubDate>Mon, 09 Jan 2012 09:48:46 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[CEM]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Ray Tracing]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=4359</guid>
		<description><![CDATA[Abstract: Savant is a asymptotic ray-tracing CEM tool used to predict the performance of antennas installed on electrically large platforms, including far-field antenna patterns, near-field distributions, and antenna-to-antenna coupling. Savant is based on the shooting and bouncing rays (SBR) formulation. While asymptotic solvers like Savant have significantly smaller computational and memory requirements for electrically large [...]]]></description>
			<content:encoded><![CDATA[<p>Abstract:</p>
<blockquote><p>Savant is a asymptotic ray-tracing CEM tool used to predict the performance of antennas installed on electrically large platforms, including far-field antenna patterns, near-field distributions, and antenna-to-antenna coupling. Savant is based on the shooting and bouncing rays (SBR) formulation. While asymptotic solvers like Savant have significantly smaller computational and memory requirements for electrically large problems than full-wave techniques, the computation costs still increase significantly with frequency and simulation fidelity, and such solvers benefit greatly from parallelization techniques. Graphics processing units (GPUs) are throughput-oriented processing devices that are well suited for the mathematically intensive workloads found in CEM solvers. Current GPUs contain hundreds of processing units, leverage thousands of threads, and can execute over one trillion floating-point operations per second. A hybrid CPU and GPU parallelization approach has been developed for Savant, providing significant speedups compared to CPU-only implementations. Results from the execution of GPU-accelerated Savant on multiple case studies will be presented.</p></blockquote>
<p>(T. Courtney, J. E. Stone and R. Kipp, <em>“Using GPUs to Accelerate installed antenna performance simulations,”</em> Proc. Allerton Antenna Symposium, Sept. 2011, Monticello, IL. [<a title="direct link to PDF" href="http://www.delcross.com/publications/SavantGPU-Allerton2011.pdf" target="_blank">PDF</a>])</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2012/01/09/installed-antenna-performance-simulations/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CFP: High Performance Graphics 2012</title>
		<link>http://gpgpu.org/2012/01/06/cfp-hpg-2012</link>
		<comments>http://gpgpu.org/2012/01/06/cfp-hpg-2012#comments</comments>
		<pubDate>Fri, 06 Jan 2012 12:06:34 +0000</pubDate>
		<dc:creator>Mark Harris</dc:creator>
				<category><![CDATA[Events]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[Call for Papers]]></category>
		<category><![CDATA[Computer Graphics]]></category>
		<category><![CDATA[Conferences]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=4339</guid>
		<description><![CDATA[High Performance Graphics is the leading international forum for performance-oriented graphics systems research including innovative algorithms, efficient implementations, and hardware architecture. The conference brings together researchers, engineers, and architects to discuss the complex interactions of massively parallel hardware, novel programming models, efficient graphics algorithms, and novel applications. High Performance Graphics was founded in 2009 to [...]]]></description>
			<content:encoded><![CDATA[<p>High Performance Graphics is the leading international forum for performance-oriented graphics systems research including innovative algorithms, efficient implementations, and hardware architecture. The conference brings together researchers, engineers, and architects to discuss the complex interactions of massively parallel hardware, novel programming models, efficient graphics algorithms, and novel applications. High Performance Graphics was founded in 2009 to synthesize and broaden on two important and well-respected conferences in computer graphics: Graphics Hardware and Interactive Ray Tracing.</p>
<p>HPG 2012 is co-sponsored by Eurographics and ACM SIGGRAPH and will take place on June 25-27, is co-located with the Eurographics Symposium on Rendering in Paris, France. We invite original and innovative performance-oriented contributions from all areas of graphics, including hardware architectures, rendering, physics, animation, simulation, and data structures, with topics including (but not limited to): Interactive rendering pipelines (hardware or software); Interactive rendering algorithms (hardware or software); Graphics hardware and systems; Languages and compilation; Parallel computing for graphics; and Mobile graphics. Please see the conference website for the full CFP.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2012/01/06/cfp-hpg-2012/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CfP: High Performance Simulation of Biological Systems</title>
		<link>http://gpgpu.org/2012/01/04/cfp-hpsbs</link>
		<comments>http://gpgpu.org/2012/01/04/cfp-hpsbs#comments</comments>
		<pubDate>Wed, 04 Jan 2012 10:56:58 +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[Workshops]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=4329</guid>
		<description><![CDATA[This workshop is organized by Horacio Pérez-Sánchez and José M. Cecilia and takes place in conjunction with the International Conference on Modeling &#38; Applied Simulation (MAS 2012). The goal is to explore the use of emerging parallel computing architectures as well as High Performance Computing systems (Supercomputers, Clusters, Grids) for the simulation of relevant biological [...]]]></description>
			<content:encoded><![CDATA[<p>This workshop is organized by Horacio Pérez-Sánchez and José M. Cecilia and takes place in conjunction with the International Conference on Modeling &amp; Applied Simulation <a title="MAS12 homepage" href="http://www.msc-les.org/Conf/MAS2012" target="_blank">(MAS 2012</a>). The goal is to explore the use of emerging parallel computing architectures as well as High Performance Computing systems (Supercomputers, Clusters, Grids) for the simulation of relevant biological systems. We welcome papers, not submitted elsewhere for review, with a focus in topics of interest ranging from but not limited to:</p>
<ul>
<li>Parallel stochastic simulation</li>
<li>Biological and Numerical parallel computing</li>
<li>Parallel and distributed architectures</li>
<li>Emerging processing architectures (e.g. GPUs, FPGAs, mixed CPU-GPU or CPU-FPGA)</li>
<li>Parallel Model checking techniques.</li>
<li>Parallel algorithms for biological analysis.</li>
<li>Cluster and Grid Deployment for system biology</li>
<li>Tools and applications</li>
<li>Biologically inspired algorithms.</li>
</ul>
<p>More details, including dates, deadlines and submission instructions, are available on the <a title="workshop web page" href="http://www.msc-les.org/Conf/MAS2012/index_file/HighPerformanceSimulationOfBiologicalSystems.htm" target="_blank">workshop web page</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2012/01/04/cfp-hpsbs/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>HOOMD-blue 0.10.0 release</title>
		<link>http://gpgpu.org/2011/12/19/hoomd-blue-0-10-0-release</link>
		<comments>http://gpgpu.org/2011/12/19/hoomd-blue-0-10-0-release#comments</comments>
		<pubDate>Mon, 19 Dec 2011 07:44:41 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Developer Resources]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[High-Performance Computing]]></category>
		<category><![CDATA[Molecular Dynamics]]></category>
		<category><![CDATA[NVIDIA CUDA]]></category>
		<category><![CDATA[Open Source]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=4279</guid>
		<description><![CDATA[HOOMD-blue performs general-purpose particle dynamics simulations on a single workstation, taking advantage of NVIDIA GPUs to attain a level of performance equivalent to many cores on a fast cluster. Flexible and configurable, HOOMD-blue is currently being used for coarse-grained molecular dynamics simulations of nano-materials, glasses, and surfactants, dissipative particle dynamics simulations (DPD) of polymers, and [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://codeblue.umich.edu/hoomd-blue/">HOOMD-blue</a> performs general-purpose particle dynamics simulations on a single workstation, taking advantage of NVIDIA GPUs to attain a level of performance equivalent to many cores on a fast cluster. Flexible and configurable, HOOMD-blue is currently being used for coarse-grained molecular dynamics simulations of nano-materials, glasses, and surfactants, dissipative particle dynamics simulations (DPD) of polymers, and crystallization of metals.</p>
<p>HOOMD-blue 0.10.0 adds many new features. Highlights include:<span id="more-4279"></span></p>
<ul>
<li>Added <strong>pair.dpdlj</strong> which uses the <span class="caps">DPD </span>thermostat and the Lennard-Jones potential. In previous versions, this could be accomplished by using two pair commands but at the cost of reduced performance.</li>
<li>Additional example scripts are now present in the documentation. The example scripts are cross-linked to the commands that are used in them.</li>
<li>Most dump commands now accept the form: <strong>dump.ext(filename=&#8221;filename.ext&#8221;)</strong> which immediately writes out filename.ext.</li>
<li>Specify rigid bodies in <span class="caps">XML </span>input files</li>
<li>Simulations that contain rigid body constraints applied to groups of particles in <span class="caps">BDNVT, NVE, NVT, </span>and <span class="caps">NPT </span>ensembles.</li>
<li>Energy minimization of rigid bodies ( <strong>integrate.mode_minimize_rigid_fire</strong> )</li>
<li>Existing commands are now rigid-body aware</li>
<li><span class="caps">NVT </span>integration using the Berendsen thermostat ( <strong>integrate.berendsen</strong> )</li>
<li>Bonds, angles, dihedrals, and impropers can now be created and deleted with the python data access <span class="caps">API.</span></li>
<li>and <a href="http://codeblue.umich.edu/hoomd-blue/">more</a></li>
</ul>
<p>HOOMD-blue 0.10.0 is available for <a href="http://codeblue.umich.edu/hoomd-blue/download.html">download</a> under an open source license. Check out the <a href="http://codeblue.umich.edu/hoomd-blue/doc/page_quick_start.html">quick start tutorial</a> to get started, or check out the <a href="http://codeblue.umich.edu/hoomd-blue/doc/index.html">full documentation</a> to see everything it can do.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2011/12/19/hoomd-blue-0-10-0-release/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>On the Acceleration of Wavefront Applications using Distributed Many-Core Architectures</title>
		<link>http://gpgpu.org/2011/12/14/acceleration-of-wavefront-applications</link>
		<comments>http://gpgpu.org/2011/12/14/acceleration-of-wavefront-applications#comments</comments>
		<pubDate>Wed, 14 Dec 2011 09:26:00 +0000</pubDate>
		<dc:creator>dom</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[Clusters]]></category>
		<category><![CDATA[High-Performance Computing]]></category>
		<category><![CDATA[Linear Algebra]]></category>
		<category><![CDATA[NVIDIA CUDA]]></category>
		<category><![CDATA[Papers]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=4264</guid>
		<description><![CDATA[Abstract: In this paper we investigate the use of distributed graphics processing unit (GPU)-based architectures to accelerate pipelined wavefront applications—a ubiquitous class of parallel algorithms used for the solution of a number of scientific and engineering applications. Specifically, we employ a recently developed port of the LU solver (from the NAS Parallel Benchmark suite) to [...]]]></description>
			<content:encoded><![CDATA[<p>Abstract:</p>
<blockquote><p>In this paper we investigate the use of distributed graphics processing unit (GPU)-based architectures to accelerate pipelined wavefront applications—a ubiquitous class of parallel algorithms used for the solution of a number of scientific and engineering applications. Specifically, we employ a recently developed port of the LU solver (from the NAS Parallel Benchmark suite) to investigate the performance of these algorithms on high-performance computing solutions from NVIDIA (Tesla C1060 and C2050) as well as on traditional clusters (AMD/InfiniBand and IBM BlueGene/P).</p>
<p>Benchmark results are presented for problem classes A to C and a recently developed performance model is used to provide projections for problem classes D and E, the latter of which represents a billion-cell problem. Our results demonstrate that while the theoretical performance of GPU solutions will far exceed those of many traditional technologies, the sustained application performance is currently comparable for scientific wavefront applications. Finally, a breakdown of the GPU solution is conducted, exposing PCIe overheads and decomposition constraints. A new k-blocking strategy is proposed to improve the future performance of this class of algorithm on GPU-based architectures.</p></blockquote>
<p>(Pennycook, S.J., Hammond, S.D., Mudalige, G.R., Wright, S.A. and Jarvis, S.A.: <em>&#8220;On the Acceleration of Wavefront Applications using Distributed Many-Core Architectures&#8221;</em>,  The Computer Journal (in press) [<a href="http://dx.doi.org/10.1093/comjnl/bxr073" target="_blank">DOI</a>] [<a href="http://eprints.dcs.warwick.ac.uk/787/" target="_blank">PREPRINT</a>])</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2011/12/14/acceleration-of-wavefront-applications/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>WCCM Minisymposium: Applications and methods of GPU</title>
		<link>http://gpgpu.org/2011/12/07/applications-and-methods-of-gpu-wccm</link>
		<comments>http://gpgpu.org/2011/12/07/applications-and-methods-of-gpu-wccm#comments</comments>
		<pubDate>Wed, 07 Dec 2011 18:22:05 +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[Workshops]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=4249</guid>
		<description><![CDATA[Since the last WCCM (Sydney 2009), where we organized a similarly themed minisymposium, the scientific and engineering communities have gained much experience in using GPU hardware for their applications. The number of publications addressing GPU applications has skyrocketed, while researchers have developed much common understanding of how to implement numerical methods in this architecture. Moreover, [...]]]></description>
			<content:encoded><![CDATA[<p>Since the last WCCM (Sydney 2009), where we organized a similarly themed minisymposium, the scientific and engineering communities have gained much experience in using GPU hardware for their applications. The number of publications addressing GPU applications has skyrocketed, while researchers have developed much common understanding of how to implement numerical methods in this architecture. Moreover, we now find that three of the five fastest computers in the world, as measured for the Top500 list, are GPU-based systems. There is much conversation about GPUs playing a leading role in the exascale computing world. In summary, this topic is of wide interest; frankly, it is all the rage. This minisymposium will concentrate presentations from the top researchers in the world using GPU hardware for applications in all branches of computational mechanics. We encourage contributions that address innovative methods to use GPUs efficiently, studies in numerical methods as they apply to adapting to the hardware and perspectives on the future of GPUs as we advance toward exascale.</p>
<p>WCCM will be held at São Paolo, Brazil, 8–13 July 2012.  The abstract submission deadline is  December 31, 2011. More information: <a href="http://www.wccm2012.com" target="_blank">http://www.wccm2012.com</a>, <a href="http://barbagroup.bu.edu/Barba_group/Events.html" target="_blank">http://barbagroup.bu.edu/Barba_group/Events.html</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2011/12/07/applications-and-methods-of-gpu-wccm/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>CfP: 4th Workshop on using Emerging Parallel Architectures (WEPA)</title>
		<link>http://gpgpu.org/2011/11/20/cfp-4th-workshop-on-using-emerging-parallel-architectures-wepa</link>
		<comments>http://gpgpu.org/2011/11/20/cfp-4th-workshop-on-using-emerging-parallel-architectures-wepa#comments</comments>
		<pubDate>Sun, 20 Nov 2011 12:11:01 +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[Workshops]]></category>

		<guid isPermaLink="false">http://gpgpu.org/?p=4190</guid>
		<description><![CDATA[The 4th Workshop on using Emerging Parallel Architectures (WEPA 2012) is held in conjunction with the International Conference on Computational Science (ICCS 2012), Omaha, Nebraska, June 2-4, 2011. The computing landscape has undergone significant transformation with the emergence of more powerful processing elements such as GPUs, FPGAs, multi-cores, etc. On the multi-core front, Moore’s Law [...]]]></description>
			<content:encoded><![CDATA[<p>The <a title="WEPA homepage" href="http://www.staff.uni-mainz.de/schmi033/" target="_blank">4th Workshop on using Emerging Parallel Architectures (WEPA 2012)</a> is held in conjunction with the <a title="ICCS homepage" href="http://www.iccs-meeting.org/" target="_blank">International Conference on Computational Science (ICCS 2012)</a>, Omaha, Nebraska, June 2-4, 2011.</p>
<p>The computing landscape has undergone significant transformation with the emergence of more powerful processing elements such as GPUs, FPGAs, multi-cores, etc. On the multi-core front, Moore’s Law has transcended beyond the single processor boundary with the prediction that the number of cores will double every 18 months. Going forward, the primary method of gaining processor performance will be through parallelism. Multi-core technology has visibly penetrated the global market. Accordingly to the latest Top500 lists the HPC landscape has evolved from supercomputer systems into large clusters of dual or quad-core processors. Furthermore, GPUs, FPGAs and multi-cores have been shown to be formidable computing alternatives, where certain classes of applications witness more than one order of magnitude improvement over their GPP counterpart. Therefore, future computational science centers will employ resources such as FPGA and GPU architectures to serve as co-processors to offload appropriate compute-intensive portions of applications from the servers.<span id="more-4190"></span></p>
<p>This workshop provides a forum for exploring the capabilities of emerging parallel architectures to accelerate computational science applications. Papers are being sought on a wide variety of topics related to the field of using emerging parallel architectures for computational science including but not limited to:</p>
<ul>
<li>Application studies on emerging architectures such as GPUs, FPGAs and Intel MIC</li>
<li>Parallel algorithms and methodologies on emerging architectures</li>
<li>Languages, models, tools, and compilation techniques for emerging architectures</li>
<li>Hybrid computer systems consisting of a combination of GPUs, FPGAs, etc.</li>
<li>Use of emerging architectures in clusters, grids and supercomputers</li>
</ul>
<p>More information, including submission deadlines and instructions, are available at <a title="WEPA homepage" href="http://www.staff.uni-mainz.de/schmi033/" target="_blank">http://www.staff.uni-mainz.de/schmi033</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2011/11/20/cfp-4th-workshop-on-using-emerging-parallel-architectures-wepa/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

