<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: ghc-gc-tune: Tuning Haskell GC settings for fun and profit</title>
	<atom:link href="http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settings-for-fun-and-profit/feed/" rel="self" type="application/rss+xml" />
	<link>http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settings-for-fun-and-profit/</link>
	<description>A Journal of Haskell Programming</description>
	<lastBuildDate>Mon, 03 Oct 2011 02:09:43 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: nominolo</title>
		<link>http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settings-for-fun-and-profit/#comment-524</link>
		<dc:creator><![CDATA[nominolo]]></dc:creator>
		<pubDate>Tue, 06 Jul 2010 14:49:32 +0000</pubDate>
		<guid isPermaLink="false">http://donsbot.wordpress.com/?p=578#comment-524</guid>
		<description><![CDATA[I think your theory regarding L2 is not quite plausible, because the program is actually faster when the nursery is larger than that.  Increasing the nursery size usually gives objects more time to die.  Only if you go much larger than that do you lose due to locality and make things worse.]]></description>
		<content:encoded><![CDATA[<p>I think your theory regarding L2 is not quite plausible, because the program is actually faster when the nursery is larger than that.  Increasing the nursery size usually gives objects more time to die.  Only if you go much larger than that do you lose due to locality and make things worse.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: dons00</title>
		<link>http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settings-for-fun-and-profit/#comment-523</link>
		<dc:creator><![CDATA[dons00]]></dc:creator>
		<pubDate>Tue, 06 Jul 2010 14:11:53 +0000</pubDate>
		<guid isPermaLink="false">http://donsbot.wordpress.com/?p=578#comment-523</guid>
		<description><![CDATA[Oh, its different because of different values of N supplied, I think. I was experimenting with the plotting.]]></description>
		<content:encoded><![CDATA[<p>Oh, its different because of different values of N supplied, I think. I was experimenting with the plotting.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: dons00</title>
		<link>http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settings-for-fun-and-profit/#comment-522</link>
		<dc:creator><![CDATA[dons00]]></dc:creator>
		<pubDate>Tue, 06 Jul 2010 14:11:13 +0000</pubDate>
		<guid isPermaLink="false">http://donsbot.wordpress.com/?p=578#comment-522</guid>
		<description><![CDATA[@Simon its showing overall time:sum of MUT and GC. I&#039;ve got the memory footprint as a todo.]]></description>
		<content:encoded><![CDATA[<p>@Simon its showing overall time:sum of MUT and GC. I&#8217;ve got the memory footprint as a todo.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Simon</title>
		<link>http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settings-for-fun-and-profit/#comment-521</link>
		<dc:creator><![CDATA[Simon]]></dc:creator>
		<pubDate>Tue, 06 Jul 2010 11:33:38 +0000</pubDate>
		<guid isPermaLink="false">http://donsbot.wordpress.com/?p=578#comment-521</guid>
		<description><![CDATA[One more thing: why does the graph for binary-trees here look different to the one at http://haskell.org/haskellwiki/Ghc-gc-tune?]]></description>
		<content:encoded><![CDATA[<p>One more thing: why does the graph for binary-trees here look different to the one at <a href="http://haskell.org/haskellwiki/Ghc-gc-tune" rel="nofollow">http://haskell.org/haskellwiki/Ghc-gc-tune</a>?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Simon</title>
		<link>http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settings-for-fun-and-profit/#comment-520</link>
		<dc:creator><![CDATA[Simon]]></dc:creator>
		<pubDate>Tue, 06 Jul 2010 11:31:03 +0000</pubDate>
		<guid isPermaLink="false">http://donsbot.wordpress.com/?p=578#comment-520</guid>
		<description><![CDATA[You&#039;re a hero, this is a great tool.

Are you graphing just GC time, or overall execution time here?  It would be better to use the latter, because GC behaviour can impact locality and change the mutator time too.

I&#039;d also be very interested to see similar graphs showing the memory footprint.]]></description>
		<content:encoded><![CDATA[<p>You&#8217;re a hero, this is a great tool.</p>
<p>Are you graphing just GC time, or overall execution time here?  It would be better to use the latter, because GC behaviour can impact locality and change the mutator time too.</p>
<p>I&#8217;d also be very interested to see similar graphs showing the memory footprint.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: medeamelana</title>
		<link>http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settings-for-fun-and-profit/#comment-519</link>
		<dc:creator><![CDATA[medeamelana]]></dc:creator>
		<pubDate>Tue, 06 Jul 2010 07:56:46 +0000</pubDate>
		<guid isPermaLink="false">http://donsbot.wordpress.com/?p=578#comment-519</guid>
		<description><![CDATA[That is really cool! Nice work, Don.]]></description>
		<content:encoded><![CDATA[<p>That is really cool! Nice work, Don.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ketil</title>
		<link>http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settings-for-fun-and-profit/#comment-518</link>
		<dc:creator><![CDATA[Ketil]]></dc:creator>
		<pubDate>Tue, 06 Jul 2010 07:49:04 +0000</pubDate>
		<guid isPermaLink="false">http://donsbot.wordpress.com/?p=578#comment-518</guid>
		<description><![CDATA[Interesting that the shape of these are roughly the same, my guess due to the following components:

a) A linear cost for heap size, which causes time to rise for huge -H values.  malloc(1G) doesn&#039;t seem to cost any measurable amount on my computer, does ghc do something to the allocated memory, or what?

b) an inverse cost for allocation area size, making very small -A values quite expensive, and responsible for the &quot;ski-jump&quot; shape for low -H

c) -A cost becomes mostly irrelevant when -H is big enough - perhaps to fit the working set - eliminating the ski jump.

GHC defaults are -H 0 and -A 512K.  These are small benchmarks, and in general, I don&#039;t think we can expect -H to be big enough to avoid the ski jump.

It&#039;d be interesting to see how the other benchmarks fare, and also how things work out on other CPUs with different cache sizes etc.  Perhaps information from -s output (number of collections etc) could be incorporated?  Anyway, great work, Don!]]></description>
		<content:encoded><![CDATA[<p>Interesting that the shape of these are roughly the same, my guess due to the following components:</p>
<p>a) A linear cost for heap size, which causes time to rise for huge -H values.  malloc(1G) doesn&#8217;t seem to cost any measurable amount on my computer, does ghc do something to the allocated memory, or what?</p>
<p>b) an inverse cost for allocation area size, making very small -A values quite expensive, and responsible for the &#8220;ski-jump&#8221; shape for low -H</p>
<p>c) -A cost becomes mostly irrelevant when -H is big enough &#8211; perhaps to fit the working set &#8211; eliminating the ski jump.</p>
<p>GHC defaults are -H 0 and -A 512K.  These are small benchmarks, and in general, I don&#8217;t think we can expect -H to be big enough to avoid the ski jump.</p>
<p>It&#8217;d be interesting to see how the other benchmarks fare, and also how things work out on other CPUs with different cache sizes etc.  Perhaps information from -s output (number of collections etc) could be incorporated?  Anyway, great work, Don!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alessandro Stamatto</title>
		<link>http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settings-for-fun-and-profit/#comment-517</link>
		<dc:creator><![CDATA[Alessandro Stamatto]]></dc:creator>
		<pubDate>Tue, 06 Jul 2010 02:26:02 +0000</pubDate>
		<guid isPermaLink="false">http://donsbot.wordpress.com/?p=578#comment-517</guid>
		<description><![CDATA[Fantastic Tool Don!]]></description>
		<content:encoded><![CDATA[<p>Fantastic Tool Don!</p>
]]></content:encoded>
	</item>
</channel>
</rss>
