<?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: Computer processes, human processes, and scalability</title>
	<atom:link href="http://www.johndcook.com/blog/2008/07/15/computer-processes-human-processes-and-scalability/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.johndcook.com/blog/2008/07/15/computer-processes-human-processes-and-scalability/</link>
	<description>The blog of John D. Cook</description>
	<lastBuildDate>Sat, 11 Feb 2012 22:42:11 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Neil Gunther</title>
		<link>http://www.johndcook.com/blog/2008/07/15/computer-processes-human-processes-and-scalability/comment-page-1/#comment-16962</link>
		<dc:creator>Neil Gunther</dc:creator>
		<pubDate>Tue, 05 May 2009 05:57:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/2008/07/15/computer-processes-human-processes-and-scalability/#comment-16962</guid>
		<description>A lot of HPC codes can exhibit near-linear scalability if the computational tasks are sufficiently fine-grained and can be multi-threaded. But &lt;a href=&quot;http://perfdynamics.blogspot.com/2009/02/poor-scalability-on-multicore.html&quot; rel=&quot;nofollow&quot;&gt;not always&lt;/a&gt;. Note that the Sandia representation of latency (the bathtub curve) is analogous to &lt;a href=&quot;http://en.wikipedia.org/wiki/Brooks&#039;_law&quot; rel=&quot;nofollow&quot;&gt;Brooks&#039; law&lt;/a&gt; for the &quot;scalability of human processes.&quot; :)

As a mathematician, you might find it interesting that scalability can be &lt;b&gt;quantified&lt;/b&gt; as &lt;a href=&quot;http://arxiv.org/abs/0808.1431&quot; rel=&quot;nofollow&quot;&gt;&quot;A General Theory of Computational Scalability Based on Rational Functions&quot;&lt;/a&gt;. This unifying model subsumes Amdahl&#039;s law, Gustafson&#039;s law and the retrograde effects seen at Sandia (as well as elsewhere).</description>
		<content:encoded><![CDATA[<p>A lot of HPC codes can exhibit near-linear scalability if the computational tasks are sufficiently fine-grained and can be multi-threaded. But <a href="http://perfdynamics.blogspot.com/2009/02/poor-scalability-on-multicore.html" rel="nofollow">not always</a>. Note that the Sandia representation of latency (the bathtub curve) is analogous to <a href="http://en.wikipedia.org/wiki/Brooks'_law" rel="nofollow">Brooks&#8217; law</a> for the &#8220;scalability of human processes.&#8221; <img src='http://www.johndcook.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>As a mathematician, you might find it interesting that scalability can be <b>quantified</b> as <a href="http://arxiv.org/abs/0808.1431" rel="nofollow">&#8220;A General Theory of Computational Scalability Based on Rational Functions&#8221;</a>. This unifying model subsumes Amdahl&#8217;s law, Gustafson&#8217;s law and the retrograde effects seen at Sandia (as well as elsewhere).</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.305 seconds -->

