<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Unrolled linked lists</title><link>http://blogs.msdn.com/devdev/archive/2005/08/22/454887.aspx</link><description>Today I'll be discussing unrolled linked lists , a simple variant of the linked list which has many of its desirable properties but exploits the cache to yield considerably better performance on modern PCs. In elementary data structures classes, students</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>re: Unrolled linked lists</title><link>http://blogs.msdn.com/devdev/archive/2005/08/22/454887.aspx#454931</link><pubDate>Tue, 23 Aug 2005 07:10:47 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:454931</guid><dc:creator>Dean Harding</dc:creator><description>Awesome post!!  Very interesting.  You're going on my blogroll :-)</description></item><item><title>re: Unrolled linked lists</title><link>http://blogs.msdn.com/devdev/archive/2005/08/22/454887.aspx#523340</link><pubDate>Thu, 02 Feb 2006 21:04:24 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:523340</guid><dc:creator>Sébastien Lorion</dc:creator><description>Peter Golde implemented just that in his class BigList in PowerCollections.</description></item><item><title>Crazy Hobbit   &amp;raquo; New Links</title><link>http://blogs.msdn.com/devdev/archive/2005/08/22/454887.aspx#526834</link><pubDate>Tue, 07 Feb 2006 21:59:39 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:526834</guid><dc:creator>Crazy Hobbit   » New Links</dc:creator><description>PingBack from &lt;a rel="nofollow" target="_new" href="http://friends-world.org/pheleen/?p=19"&gt;http://friends-world.org/pheleen/?p=19&lt;/a&gt;</description></item><item><title>re: Unrolled linked lists</title><link>http://blogs.msdn.com/devdev/archive/2005/08/22/454887.aspx#3094721</link><pubDate>Tue, 05 Jun 2007 12:39:01 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:3094721</guid><dc:creator>Tanveer Badar</dc:creator><description>&lt;p&gt;Isn't it the same thing as C++ deque?&lt;/p&gt;</description></item><item><title>Cache-oblivious data structures</title><link>http://blogs.msdn.com/devdev/archive/2005/08/22/454887.aspx#3256807</link><pubDate>Tue, 12 Jun 2007 23:53:52 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:3256807</guid><dc:creator>Developing for Developers</dc:creator><description>&lt;p&gt;In most data structure and algorithms classes, the model used for basic analysis is the traditional RAM&lt;/p&gt;
</description></item><item><title>MSDN Blog Postings &amp;middot; Cache-oblivious data structures</title><link>http://blogs.msdn.com/devdev/archive/2005/08/22/454887.aspx#3257940</link><pubDate>Wed, 13 Jun 2007 01:31:18 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:3257940</guid><dc:creator>MSDN Blog Postings · Cache-oblivious data structures</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://msdnrss.thecoderblogs.com/2007/06/12/cache-oblivious-data-structures/"&gt;http://msdnrss.thecoderblogs.com/2007/06/12/cache-oblivious-data-structures/&lt;/a&gt;&lt;/p&gt;</description></item><item><title>linked lists</title><link>http://blogs.msdn.com/devdev/archive/2005/08/22/454887.aspx#8421509</link><pubDate>Thu, 24 Apr 2008 15:49:26 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:8421509</guid><dc:creator>linked lists</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://zoe.unrestrictednews.com/linkedlists.html"&gt;http://zoe.unrestrictednews.com/linkedlists.html&lt;/a&gt;&lt;/p&gt;
</description></item><item><title>re: Code required</title><link>http://blogs.msdn.com/devdev/archive/2005/08/22/454887.aspx#8960593</link><pubDate>Sun, 21 Sep 2008 19:47:21 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:8960593</guid><dc:creator>Tushar</dc:creator><description>&lt;p&gt;Please provide me the code for implementation of unrolled linked list in c language.&lt;/p&gt;</description></item><item><title> Developing for Developers Unrolled linked lists | Paid Surveys</title><link>http://blogs.msdn.com/devdev/archive/2005/08/22/454887.aspx#9659386</link><pubDate>Sat, 30 May 2009 01:18:16 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9659386</guid><dc:creator> Developing for Developers Unrolled linked lists | Paid Surveys</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://paidsurveyshub.info/story.php?title=developing-for-developers-unrolled-linked-lists"&gt;http://paidsurveyshub.info/story.php?title=developing-for-developers-unrolled-linked-lists&lt;/a&gt;&lt;/p&gt;
</description></item></channel></rss>