<?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>Throughput and Latency Considerations: Errata</title><link>http://blogs.msdn.com/ricom/archive/2006/07/24/677566.aspx</link><description>Well hats off to Ian Griffiths who pointed out that I had screwed up my math in my previous posting . When I went back to double check I found that I had made two fatal mistakes. Now I went back and used a better technique which I present below but --</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>re: Throughput and Latency Considerations: Errata</title><link>http://blogs.msdn.com/ricom/archive/2006/07/24/677566.aspx#677586</link><pubDate>Tue, 25 Jul 2006 07:50:40 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:677586</guid><dc:creator>ricom</dc:creator><description>The fact that the optimal number of threads to run is changing is further complicating things but I'm basically disregarding that for now. &amp;nbsp;I mentioned one of the interactions -- that there might not be enough items in the queue -- but of course another is scheduling overhead which I'm disregarding entirely. &amp;nbsp;Not to mention the presence of critical sections in the code which might prevent us from scaling linearly.&lt;br&gt;&lt;br&gt;The only real point here is that small computational benefits can actually end up being bigger than they appear at first because of the side-benefits they bring.&lt;br&gt;&lt;br&gt;I'll post again after I've had someone double check the corrected model for accuracy such as it is.</description></item><item><title>re: Throughput and Latency Considerations: Errata</title><link>http://blogs.msdn.com/ricom/archive/2006/07/24/677566.aspx#678123</link><pubDate>Tue, 25 Jul 2006 21:51:39 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:678123</guid><dc:creator>ricom</dc:creator><description>OK I've had a couple people look at this and I'm pretty sure it's right now. &amp;nbsp;Plus or minus the simplification I made in modelling the multi-threading that's going on. &amp;nbsp;Really you could get rid of that and it wouldn't affect the concept I'm trying to illustrate. &amp;nbsp;Just disregard the delay to the back end in my example and it's a straight queue (an M/M/1 queue).&lt;br&gt;&lt;br&gt;If it's wrong now at least I can say other smart people also got it wrong :)&lt;br&gt;&lt;br&gt;</description></item></channel></rss>