<?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: The Cambrian Period of Concurrency</title>
	<atom:link href="http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/</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: Knowing .NET &#187; Blog Archive &#187; Link Clearance</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16782</link>
		<dc:creator>Knowing .NET &#187; Blog Archive &#187; Link Clearance</dc:creator>
		<pubDate>Wed, 24 Feb 2010 23:54:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16782</guid>
		<description>[...] The Cambrian Period of Concurrency [...]</description>
		<content:encoded><![CDATA[<p>[...] The Cambrian Period of Concurrency [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Clojure &#8211; Destillat #2 &#124; duetsch.info - Open Source, Wet-, Web-, Software</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16651</link>
		<dc:creator>Clojure &#8211; Destillat #2 &#124; duetsch.info - Open Source, Wet-, Web-, Software</dc:creator>
		<pubDate>Sat, 30 Jan 2010 08:59:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16651</guid>
		<description>[...] The Cambrian Period of Concurrency [...]</description>
		<content:encoded><![CDATA[<p>[...] The Cambrian Period of Concurrency [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Concurrency &#171; Programmagic!</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16540</link>
		<dc:creator>Concurrency &#171; Programmagic!</dc:creator>
		<pubDate>Thu, 29 Oct 2009 05:16:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16540</guid>
		<description>[...] Leung at his blog wrote an article about concurrency called The Cambrian Period of Concurrency (and a follow-up). He also gave a talk [...]</description>
		<content:encoded><![CDATA[<p>[...] Leung at his blog wrote an article about concurrency called The Cambrian Period of Concurrency (and a follow-up). He also gave a talk [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: links for 2009-10-19 &#171; Object neo = neo Object</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16526</link>
		<dc:creator>links for 2009-10-19 &#171; Object neo = neo Object</dc:creator>
		<pubDate>Tue, 20 Oct 2009 04:31:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16526</guid>
		<description>[...] The Cambrian Period of Concurrency at Ted Leung on the Air (tags: concurrency multicore) [...]</description>
		<content:encoded><![CDATA[<p>[...] The Cambrian Period of Concurrency at Ted Leung on the Air (tags: concurrency multicore) [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Which is the best language for parallel programming? &#171; SoftTalk &#8211; multicore and parallel programming</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16519</link>
		<dc:creator>Which is the best language for parallel programming? &#171; SoftTalk &#8211; multicore and parallel programming</dc:creator>
		<pubDate>Tue, 13 Oct 2009 08:56:31 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16519</guid>
		<description>[...] was interested to see Ted Leung&#8217;s recent blog post reviewing the strengths of different programming languages for concurrent programming. That wasn&#8217;t his goal: his aim was to talk about constructs, but [...]</description>
		<content:encoded><![CDATA[<p>[...] was interested to see Ted Leung&#8217;s recent blog post reviewing the strengths of different programming languages for concurrent programming. That wasn&#8217;t his goal: his aim was to talk about constructs, but [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ted Leung</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16503</link>
		<dc:creator>Ted Leung</dc:creator>
		<pubDate>Thu, 08 Oct 2009 22:50:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16503</guid>
		<description>Ulf,

Sorry to be vague on size.   I mostly meant number of machines / number of cores.   Certainly the sizes of Erlang software systems is sizable.    

As far as SMP goes, I&#039;m looking at the high core count machines, and pretty much everybody is on the same footing there, simply because the hardware is pretty recent.</description>
		<content:encoded><![CDATA[<p>Ulf,</p>
<p>Sorry to be vague on size.   I mostly meant number of machines / number of cores.   Certainly the sizes of Erlang software systems is sizable.    </p>
<p>As far as SMP goes, I&#8217;m looking at the high core count machines, and pretty much everybody is on the same footing there, simply because the hardware is pretty recent.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ulf Wiger</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16501</link>
		<dc:creator>Ulf Wiger</dc:creator>
		<pubDate>Thu, 08 Oct 2009 20:43:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16501</guid>
		<description>Ted,

When you say that most Erlang-based applications you&#039;ve heard of are small, on what dimension do you measure? Number of cores? Number of computers? Number of concurrent processes? LOC?

In terms of LOC, there are several commercial systems built in Erlang with hundreds of thousand lines of code. The biggest I know of is closer to 2 million. It&#039;s not uncommon for these systems to have tens of thousand concurrent processes on each node. These systems were not described at the Erlang Factory, since they are more or less &#039;legacy&#039; in the Erlang community.

In terms of number of cores, I know of prototype systems using 24 cores, but this is largely uncharted territory. The long-running telecom systems are mainly using quad-cores AFAIK. They tend to lag behind, since they need to wait for NEBS-compliant versions of the processor boards.

Since you mention Facebook chat, I&#039;m tempted to think that you mean &#039;big&#039; in terms of number of computers. Otherwise, in terms of functional content, the Kreditor system mentioned at the Factory is far more complex.

Commercial, high-availability products have been using SMP Erlang in the field since 2007. Granted, this is not a terribly long time, but I think there are certainly enough commercial users out there to label SMP Erlang as battle tested.</description>
		<content:encoded><![CDATA[<p>Ted,</p>
<p>When you say that most Erlang-based applications you&#8217;ve heard of are small, on what dimension do you measure? Number of cores? Number of computers? Number of concurrent processes? LOC?</p>
<p>In terms of LOC, there are several commercial systems built in Erlang with hundreds of thousand lines of code. The biggest I know of is closer to 2 million. It&#8217;s not uncommon for these systems to have tens of thousand concurrent processes on each node. These systems were not described at the Erlang Factory, since they are more or less &#8216;legacy&#8217; in the Erlang community.</p>
<p>In terms of number of cores, I know of prototype systems using 24 cores, but this is largely uncharted territory. The long-running telecom systems are mainly using quad-cores AFAIK. They tend to lag behind, since they need to wait for NEBS-compliant versions of the processor boards.</p>
<p>Since you mention Facebook chat, I&#8217;m tempted to think that you mean &#8216;big&#8217; in terms of number of computers. Otherwise, in terms of functional content, the Kreditor system mentioned at the Factory is far more complex.</p>
<p>Commercial, high-availability products have been using SMP Erlang in the field since 2007. Granted, this is not a terribly long time, but I think there are certainly enough commercial users out there to label SMP Erlang as battle tested.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Linktipps #15 :: Blackflash</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16498</link>
		<dc:creator>Linktipps #15 :: Blackflash</dc:creator>
		<pubDate>Wed, 07 Oct 2009 15:20:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16498</guid>
		<description>[...]  [...]</description>
		<content:encoded><![CDATA[<p>[...]  [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Równoleg?o?? /= wspó?bie?no?? &#171; Haskell. Po polsku.</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16497</link>
		<dc:creator>Równoleg?o?? /= wspó?bie?no?? &#171; Haskell. Po polsku.</dc:creator>
		<pubDate>Wed, 07 Oct 2009 14:22:26 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16497</guid>
		<description>[...] mnie, gdy widz? porównanie wspó?bie?no?ci w Haskellu do wsparcia dla wspó?bie?no?ci w innych j?zykach, gdy celem jest tylko i wy??cznie u?ycie wielordzeniowego procesora. Nie o to chodzi: tak, [...]</description>
		<content:encoded><![CDATA[<p>[...] mnie, gdy widz? porównanie wspó?bie?no?ci w Haskellu do wsparcia dla wspó?bie?no?ci w innych j?zykach, gdy celem jest tylko i wy??cznie u?ycie wielordzeniowego procesora. Nie o to chodzi: tak, [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tom</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16496</link>
		<dc:creator>Tom</dc:creator>
		<pubDate>Wed, 07 Oct 2009 09:59:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16496</guid>
		<description>Clojure as a ton of interesting ideas in it -&gt; Clojure has a ton...</description>
		<content:encoded><![CDATA[<p>Clojure as a ton of interesting ideas in it -&gt; Clojure has a ton&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tom</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16495</link>
		<dc:creator>Tom</dc:creator>
		<pubDate>Wed, 07 Oct 2009 09:48:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16495</guid>
		<description>typo
Jacob Kaplan-Moss made referred -&gt; ... made references</description>
		<content:encoded><![CDATA[<p>typo<br />
Jacob Kaplan-Moss made referred -&gt; &#8230; made references</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Concurrency =&#62; Parallelism at Ted Leung on the Air</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16493</link>
		<dc:creator>Concurrency =&#62; Parallelism at Ted Leung on the Air</dc:creator>
		<pubDate>Wed, 07 Oct 2009 06:44:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16493</guid>
		<description>[...] Good Books          &#171; The Cambrian Period of Concurrency [...]</description>
		<content:encoded><![CDATA[<p>[...] Good Books          &laquo; The Cambrian Period of Concurrency [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ted Leung</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16492</link>
		<dc:creator>Ted Leung</dc:creator>
		<pubDate>Wed, 07 Oct 2009 06:03:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16492</guid>
		<description>Reid,
Barrelfish is one layer down from the layer that I am interested in.  It looks promising in terms of improving the performance of message oriented models.  

Travis,
Keep in mind that most cloud environments are provisioned via some form of virtualization.   That&#039;s likely to impact any numbers that you might generate there.

Ronen,
Global interpreter locks.

Nicolas,
Yep, CTM style dataflow concurrency is definitely underrated.

Mac,
Yes, I&#039;ve seen the talk and several earlier variants, and have talked to Rich in person.

Leo,
If you are happy using multiprocessing, that&#039;s great.  It doesn&#039;t really help raise the level of concurrent programming, it&#039;s just an implementation detail for getting parallelism.</description>
		<content:encoded><![CDATA[<p>Reid,<br />
Barrelfish is one layer down from the layer that I am interested in.  It looks promising in terms of improving the performance of message oriented models.  </p>
<p>Travis,<br />
Keep in mind that most cloud environments are provisioned via some form of virtualization.   That&#8217;s likely to impact any numbers that you might generate there.</p>
<p>Ronen,<br />
Global interpreter locks.</p>
<p>Nicolas,<br />
Yep, CTM style dataflow concurrency is definitely underrated.</p>
<p>Mac,<br />
Yes, I&#8217;ve seen the talk and several earlier variants, and have talked to Rich in person.</p>
<p>Leo,<br />
If you are happy using multiprocessing, that&#8217;s great.  It doesn&#8217;t really help raise the level of concurrent programming, it&#8217;s just an implementation detail for getting parallelism.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Leo Simons</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16491</link>
		<dc:creator>Leo Simons</dc:creator>
		<pubDate>Tue, 06 Oct 2009 23:06:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16491</guid>
		<description>Thanks for the update and the nuance! I&#039;m sure people will be paying attention.

Less nuance seems ok to me in places...

&quot;Experiments being run on 2 thread MacBook Pro’s are probably not good indicators of what happens at even 8 threads.&quot;

I sort-of wonder why you feel the need for the &quot;probably&quot;?

I have not yet found an application in my current problem domains of choice (dynamic websites and analytics processing) where dual-core helps predict the performance of many-core.

But then some things deserve more nuance...

&quot;This makes it hard for me to take certain kinds of systems seriously, like concurrency solutions running on language implementations with Global Interpreter Locks.&quot;

Hmm. I&#039;ve found the multiprocessing module rather easy to use and I&#039;ve found the resulting process/threads hybrids (a bit over one process per CPU core seems to work well) sometimes work better in practice than single-process multi-hardware-thread things on the JVM. I&#039;d argue you should take seriously any setup that solves real-world problems with decent real-world performance :-)</description>
		<content:encoded><![CDATA[<p>Thanks for the update and the nuance! I&#8217;m sure people will be paying attention.</p>
<p>Less nuance seems ok to me in places&#8230;</p>
<p>&#8220;Experiments being run on 2 thread MacBook Pro’s are probably not good indicators of what happens at even 8 threads.&#8221;</p>
<p>I sort-of wonder why you feel the need for the &#8220;probably&#8221;?</p>
<p>I have not yet found an application in my current problem domains of choice (dynamic websites and analytics processing) where dual-core helps predict the performance of many-core.</p>
<p>But then some things deserve more nuance&#8230;</p>
<p>&#8220;This makes it hard for me to take certain kinds of systems seriously, like concurrency solutions running on language implementations with Global Interpreter Locks.&#8221;</p>
<p>Hmm. I&#8217;ve found the multiprocessing module rather easy to use and I&#8217;ve found the resulting process/threads hybrids (a bit over one process per CPU core seems to work well) sometimes work better in practice than single-process multi-hardware-thread things on the JVM. I&#8217;d argue you should take seriously any setup that solves real-world problems with decent real-world performance <img src='http://www.sauria.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Parallelism /= Concurrency &#171; GHC Mutterings</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16490</link>
		<dc:creator>Parallelism /= Concurrency &#171; GHC Mutterings</dc:creator>
		<pubDate>Tue, 06 Oct 2009 22:38:11 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16490</guid>
		<description>[...] pains me to see Haskell&#8217;s concurrency compared against the concurrency support in other languages, when the goal is to simply make use of multicore CPUs.  It&#8217;s missing the point: yes of [...]</description>
		<content:encoded><![CDATA[<p>[...] pains me to see Haskell&#8217;s concurrency compared against the concurrency support in other languages, when the goal is to simply make use of multicore CPUs.  It&#8217;s missing the point: yes of [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mac</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16489</link>
		<dc:creator>Mac</dc:creator>
		<pubDate>Tue, 06 Oct 2009 14:50:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16489</guid>
		<description>Rich Hickey gives a recent talk at Qcon that discuss in more depth about how clojure does it and what clojure&#039;s primary focus on concurrency is, namely single system concurrency.

http://www.infoq.com/presentations/Value-Identity-State-Rich-Hickey</description>
		<content:encoded><![CDATA[<p>Rich Hickey gives a recent talk at Qcon that discuss in more depth about how clojure does it and what clojure&#8217;s primary focus on concurrency is, namely single system concurrency.</p>
<p><a href="http://www.infoq.com/presentations/Value-Identity-State-Rich-Hickey" rel="nofollow">http://www.infoq.com/presentations/Value-Identity-State-Rich-Hickey</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nicolas Trangez</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16488</link>
		<dc:creator>Nicolas Trangez</dc:creator>
		<pubDate>Tue, 06 Oct 2009 12:53:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16488</guid>
		<description>Reading &#039;Concepts, Techniques and Models of Computer Programming&#039; at the moment (next to &#039;Real World Haskell&#039;), and it indeed is a fascinating book.

Nice overview, by the way. I&#039;ve been working with dataflow variable based systems in several languages lately, and it&#039;s definitely a useful abstraction, even though it doesn&#039;t get as much (enough?) press as actor or STM based systems.</description>
		<content:encoded><![CDATA[<p>Reading &#8216;Concepts, Techniques and Models of Computer Programming&#8217; at the moment (next to &#8216;Real World Haskell&#8217;), and it indeed is a fascinating book.</p>
<p>Nice overview, by the way. I&#8217;ve been working with dataflow variable based systems in several languages lately, and it&#8217;s definitely a useful abstraction, even though it doesn&#8217;t get as much (enough?) press as actor or STM based systems.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ronen</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16487</link>
		<dc:creator>Ronen</dc:creator>
		<pubDate>Tue, 06 Oct 2009 00:52:47 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16487</guid>
		<description>What about Stackless Python, or Fibers + assorted gems in Ruby 1.9?</description>
		<content:encoded><![CDATA[<p>What about Stackless Python, or Fibers + assorted gems in Ruby 1.9?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Travis</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16485</link>
		<dc:creator>Travis</dc:creator>
		<pubDate>Tue, 06 Oct 2009 00:21:55 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16485</guid>
		<description>&lt;blockquote&gt;
The point is, you have to run on actual hardware to have believable numbers.
&lt;/blockquote&gt;

So what&#039;s a poor developer to do?

If you&#039;ll indulge me for a moment, I think it would be real neat if I could sign up with a cloud computing service and fire up a 256 thread machine for a few hours to play with some of these concurrency paradigms in the Real World.

A million tiny Wide Finders. Exciting!</description>
		<content:encoded><![CDATA[<blockquote><p>
The point is, you have to run on actual hardware to have believable numbers.
</p></blockquote>
<p>So what&#8217;s a poor developer to do?</p>
<p>If you&#8217;ll indulge me for a moment, I think it would be real neat if I could sign up with a cloud computing service and fire up a 256 thread machine for a few hours to play with some of these concurrency paradigms in the Real World.</p>
<p>A million tiny Wide Finders. Exciting!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Reid</title>
		<link>http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/comment-page-1/#comment-16484</link>
		<dc:creator>Reid</dc:creator>
		<pubDate>Mon, 05 Oct 2009 17:16:19 +0000</pubDate>
		<guid isPermaLink="false">http://www.sauria.com/blog/2009/10/05/the-cambrian-period-of-concurrency/#comment-16484</guid>
		<description>What do you think of the MultiKernel?

http://www.barrelfish.org

The Multikernel: A new OS architecture for scalable multicore systems. In Proceedings of the 22nd ACM Symposium on OS Principles, Big Sky, MT, USA, October 2009
http://www.barrelfish.org/barrelfish_sosp09.pdf

Reid</description>
		<content:encoded><![CDATA[<p>What do you think of the MultiKernel?</p>
<p><a href="http://www.barrelfish.org" rel="nofollow">http://www.barrelfish.org</a></p>
<p>The Multikernel: A new OS architecture for scalable multicore systems. In Proceedings of the 22nd ACM Symposium on OS Principles, Big Sky, MT, USA, October 2009<br />
<a href="http://www.barrelfish.org/barrelfish_sosp09.pdf" rel="nofollow">http://www.barrelfish.org/barrelfish_sosp09.pdf</a></p>
<p>Reid</p>
]]></content:encoded>
	</item>
</channel>
</rss>

