<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments on: Concurrency =&gt; Parallelism</title>
	<atom:link href="http://www.sauria.com/blog/2009/10/06/concurrency-parallelism/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.sauria.com/blog/2009/10/06/concurrency-parallelism/</link>
	<description>Open Source, Modern Programming Languages, OS X, Photography, and ...</description>
	<lastBuildDate>Thu, 19 Jan 2012 07:08:30 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Parallelism /= Concurrency &#171; GHC Mutterings</title>
		<link>http://www.sauria.com/blog/2009/10/06/concurrency-parallelism/comment-page-1/#comment-16500</link>
		<dc:creator>Parallelism /= Concurrency &#171; GHC Mutterings</dc:creator>
		<pubDate>Thu, 08 Oct 2009 08:13:21 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/06/concurrency-parallelism/#comment-16500</guid>
		<description>[...] Concurrency =&gt; Parallelism at Ted Leung on the Air Says:  October 7, 2009 at 6:45 am [...]</description>
		<content:encoded><![CDATA[<p>[...] Concurrency =&gt; Parallelism at Ted Leung on the Air Says:  October 7, 2009 at 6:45 am [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ted Leung</title>
		<link>http://www.sauria.com/blog/2009/10/06/concurrency-parallelism/comment-page-1/#comment-16499</link>
		<dc:creator>Ted Leung</dc:creator>
		<pubDate>Wed, 07 Oct 2009 16:38:14 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/06/concurrency-parallelism/#comment-16499</guid>
		<description>Thanks for the pointer to the strategies paper - I&#039;ll definitely take a closer look.  From Chapter 24 in Real World Haskell, it looked like strategies were mostly a way of controlling the behavior of par and parseq.</description>
		<content:encoded><![CDATA[<p>Thanks for the pointer to the strategies paper &#8211; I&#8217;ll definitely take a closer look.  From Chapter 24 in Real World Haskell, it looked like strategies were mostly a way of controlling the behavior of par and parseq.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Simon Marlow</title>
		<link>http://www.sauria.com/blog/2009/10/06/concurrency-parallelism/comment-page-1/#comment-16494</link>
		<dc:creator>Simon Marlow</dc:creator>
		<pubDate>Wed, 07 Oct 2009 08:22:24 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/06/concurrency-parallelism/#comment-16494</guid>
		<description>I agree - we definitely do want to parallelise all those concurrent programs we have lying around.  But I want to correct this point:

&quot;I explicitly stated that I was not as interested in highly regular or data parallel computations, which is what Haskell’s parallelism tools are aimed at.&quot;

In addition to concurrency, Haskell has two programming models for parallelism, only one of which is aimed at highly regular data-parallel problems.  The other (Strategies) is perfectly suited to irregular problems and ad-hoc parallelisation of existing sequential programs.  Take a look at the excellent paper &quot;Algorithm + Strategies = Parallelism&quot; (http://www.macs.hw.ac.uk/~dsg/gph/papers/html/Strategies/strategies.html).</description>
		<content:encoded><![CDATA[<p>I agree &#8211; we definitely do want to parallelise all those concurrent programs we have lying around.  But I want to correct this point:</p>
<p>&#8220;I explicitly stated that I was not as interested in highly regular or data parallel computations, which is what Haskell’s parallelism tools are aimed at.&#8221;</p>
<p>In addition to concurrency, Haskell has two programming models for parallelism, only one of which is aimed at highly regular data-parallel problems.  The other (Strategies) is perfectly suited to irregular problems and ad-hoc parallelisation of existing sequential programs.  Take a look at the excellent paper &#8220;Algorithm + Strategies = Parallelism&#8221; (<a href="http://www.macs.hw.ac.uk/~dsg/gph/papers/html/Strategies/strategies.html" rel="nofollow">http://www.macs.hw.ac.uk/~dsg/gph/papers/html/Strategies/strategies.html</a>).</p>
]]></content:encoded>
	</item>
</channel>
</rss>

