<?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; Tag: Memory Models :: GPGPU.org</title>
	<atom:link href="http://gpgpu.org/tag/memory-models/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>A Memory Model for Scientic Algorithms on Graphics Processors</title>
		<link>http://gpgpu.org/2006/10/04/a-memory-model-for-scientic-algorithms-on-graphics-processors</link>
		<comments>http://gpgpu.org/2006/10/04/a-memory-model-for-scientic-algorithms-on-graphics-processors#comments</comments>
		<pubDate>Wed, 04 Oct 2006 15:19:00 +0000</pubDate>
		<dc:creator>Mark Harris</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[Cache]]></category>
		<category><![CDATA[FFT]]></category>
		<category><![CDATA[Linear Algebra]]></category>
		<category><![CDATA[Memory Models]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Sorting]]></category>

		<guid isPermaLink="false">http://www.gpgpu.org/cgi-bin/blosxom.cgi/ScientificComputing/nagaMemoryModelSC06.html</guid>
		<description><![CDATA[This Supercomputing 2006 paper by Govindaraju et al. presents a memory model to analyze and improve the performance of scientific algorithms on graphics processing units (GPUs). The memory model is based on texturing hardware, which uses a 2D block-based array representation to perform the underlying computations. It incorporates many characteristics of GPU architectures including smaller [...]]]></description>
			<content:encoded><![CDATA[<p>This <a href="http://sc06.supercomputing.org/" title="Supercomputing 2006" target="_blank">Supercomputing 2006</a> paper by Govindaraju et al. presents a memory model to analyze and improve the performance of scientific algorithms on graphics processing units (GPUs). The memory model is based on texturing hardware, which uses a 2D block-based array representation to perform the underlying computations. It incorporates many characteristics of GPU architectures including smaller cache sizes, 2D block representations, and uses the 3C&#8217;s model to analyze the cache misses. Moreover, the paper presents techniques to improve the performance of nested loops on GPUs. In order to demonstrate the effectiveness of the model, the paper highlights its performance on three memory-intensive scientific applications: sorting, Fast Fourier Transform and dense matrix multiplication. In practice, their cache-efficient algorithms for these applications are able to achieve memory throughput of 30-50 GB/s on an NVIDIA 7900 GTX GPU. The paper also compares its results with prior GPU-based and CPU-based implementations on high-end processors. In practice, they are able to achieve 2x-5x performance improvement. (<a href="http://www.cs.unc.edu/~naga/sc06.pdf" title="Paper link" target="_blank">A Memory Model for Scientic Algorithms on Graphics Processors</a>)</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2006/10/04/a-memory-model-for-scientic-algorithms-on-graphics-processors/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

