<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.3" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: How the Ruby heap is implemented</title>
	<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/</link>
	<description>Ecchi nanowa ikenai to omoimasu</description>
	<pubDate>Fri, 16 May 2008 02:18:20 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.3</generator>
		<item>
		<title>By: 赖洪礼的 blog &#187; Memory usage comparison: Rails 1.2.6 vs 2.0.2</title>
		<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-7927</link>
		<dc:creator>赖洪礼的 blog &#187; Memory usage comparison: Rails 1.2.6 vs 2.0.2</dc:creator>
		<pubDate>Wed, 19 Mar 2008 10:08:55 +0000</pubDate>
		<guid>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-7927</guid>
		<description>[...] is usually the best measurement - but not for Ruby! In the past I&#8217;ve explained how Ruby&#8217;s heap is implemented. Ruby allocates several heaps, and the heaps contain equally-sized slots in which Ruby objects are [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] is usually the best measurement - but not for Ruby! In the past I&#8217;ve explained how Ruby&#8217;s heap is implemented. Ruby allocates several heaps, and the heaps contain equally-sized slots in which Ruby objects are [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Satish Talim</title>
		<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-7118</link>
		<dc:creator>Satish Talim</dc:creator>
		<pubDate>Wed, 31 Oct 2007 00:01:38 +0000</pubDate>
		<guid>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-7118</guid>
		<description>A very interesting read. Keep it coming.</description>
		<content:encoded><![CDATA[<p>A very interesting read. Keep it coming.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sam Figueroa</title>
		<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-7065</link>
		<dc:creator>Sam Figueroa</dc:creator>
		<pubDate>Sun, 28 Oct 2007 12:23:00 +0000</pubDate>
		<guid>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-7065</guid>
		<description>I code Ruby on Rails as a side hobby. I never thought the hard internals of the Ruby heap would interest me. Your article got me hooked after the first few paragraphs. A great read. Your effort was not in vain.</description>
		<content:encoded><![CDATA[<p>I code Ruby on Rails as a side hobby. I never thought the hard internals of the Ruby heap would interest me. Your article got me hooked after the first few paragraphs. A great read. Your effort was not in vain.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: How Ruby Manages Its Memory</title>
		<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-7034</link>
		<dc:creator>How Ruby Manages Its Memory</dc:creator>
		<pubDate>Sat, 27 Oct 2007 14:17:08 +0000</pubDate>
		<guid>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-7034</guid>
		<description>[...] "How the Ruby heap is implemented," Hongli Lai looks at how Ruby manages its memory and stores your objects. It's reasonably [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] &#8220;How the Ruby heap is implemented,&#8221; Hongli Lai looks at how Ruby manages its memory and stores your objects. It&#8217;s reasonably [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Saad Savari</title>
		<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-7005</link>
		<dc:creator>Saad Savari</dc:creator>
		<pubDate>Fri, 26 Oct 2007 15:36:29 +0000</pubDate>
		<guid>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-7005</guid>
		<description>Great article. keep the good work coming</description>
		<content:encoded><![CDATA[<p>Great article. keep the good work coming</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Eric</title>
		<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-6964</link>
		<dc:creator>Eric</dc:creator>
		<pubDate>Wed, 24 Oct 2007 16:24:31 +0000</pubDate>
		<guid>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-6964</guid>
		<description>Excellent stuff, the graphics were a good call - help propigate to non-C folks.</description>
		<content:encoded><![CDATA[<p>Excellent stuff, the graphics were a good call - help propigate to non-C folks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Tsai - Blog - How the Ruby Heap Is Implemented</title>
		<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-6938</link>
		<dc:creator>Michael Tsai - Blog - How the Ruby Heap Is Implemented</dc:creator>
		<pubDate>Tue, 23 Oct 2007 14:37:10 +0000</pubDate>
		<guid>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-6938</guid>
		<description>[...] not well documented, so Hongli Lai read the code to figure it [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] not well documented, so Hongli Lai read the code to figure it [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Edward Ocampo-Gooding</title>
		<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-6937</link>
		<dc:creator>Edward Ocampo-Gooding</dc:creator>
		<pubDate>Tue, 23 Oct 2007 14:17:50 +0000</pubDate>
		<guid>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-6937</guid>
		<description>Solid article. Thanks!</description>
		<content:encoded><![CDATA[<p>Solid article. Thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: she</title>
		<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-6933</link>
		<dc:creator>she</dc:creator>
		<pubDate>Tue, 23 Oct 2007 08:17:41 +0000</pubDate>
		<guid>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-6933</guid>
		<description>woot great read
i add this link to my local ruby-to-c knowledge page :)</description>
		<content:encoded><![CDATA[<p>woot great read<br />
i add this link to my local ruby-to-c knowledge page <img src='http://izumi.plan99.net/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dan42</title>
		<link>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-6796</link>
		<dc:creator>Dan42</dc:creator>
		<pubDate>Sat, 13 Oct 2007 08:47:52 +0000</pubDate>
		<guid>http://izumi.plan99.net/blog/index.php/2007/10/12/how-the-ruby-heap-is-implemented/#comment-6796</guid>
		<description>Ruby scans the system stack because objects can be created from within C code. Imagine a C function which allocates a RString str1 and then a RString str2, but there is not enough space to allocate str2 so the garbage collector runs. At this point, since the only reference to str1 is in the system stack, the garbage collector would mistakenly free str1 if it didn't scan the system stack.</description>
		<content:encoded><![CDATA[<p>Ruby scans the system stack because objects can be created from within C code. Imagine a C function which allocates a RString str1 and then a RString str2, but there is not enough space to allocate str2 so the garbage collector runs. At this point, since the only reference to str1 is in the system stack, the garbage collector would mistakenly free str1 if it didn&#8217;t scan the system stack.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
