<?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: Worker pool &#8211; a design pattern for parallel task execution in LabVIEW</title>
	<atom:link href="http://expressionflow.com/2009/11/04/worker-pool/feed/" rel="self" type="application/rss+xml" />
	<link>http://expressionflow.com/2009/11/04/worker-pool/</link>
	<description>LabVIEW and visual programming blog</description>
	<lastBuildDate>Wed, 07 Jul 2010 22:34:08 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>By: Tomi Maila</title>
		<link>http://expressionflow.com/2009/11/04/worker-pool/comment-page-1/#comment-7030</link>
		<dc:creator>Tomi Maila</dc:creator>
		<pubDate>Wed, 07 Jul 2010 22:34:08 +0000</pubDate>
		<guid isPermaLink="false">http://expressionflow.com/?p=281#comment-7030</guid>
		<description>Ahoenselaar, thanks for the insight. In general I would not like to run more than 10000 concurrently executing tasks on any single computer system, irregardless if there is a hardware limitation or not. That thing said, it would be easy to work around the recursion limitation. If you execute m &gt; 1 parallel commands on each recursion level instead of one, you will have order of m^n concurrent tasks at recursion level n, when n &gt;&gt; 0. So practically you reach more concurrent tasks already at recursion level of order 100 than any present computer can handle.</description>
		<content:encoded><![CDATA[<p>Ahoenselaar, thanks for the insight. In general I would not like to run more than 10000 concurrently executing tasks on any single computer system, irregardless if there is a hardware limitation or not. That thing said, it would be easy to work around the recursion limitation. If you execute m > 1 parallel commands on each recursion level instead of one, you will have order of m^n concurrent tasks at recursion level n, when n >> 0. So practically you reach more concurrent tasks already at recursion level of order 100 than any present computer can handle.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ahoenselaar</title>
		<link>http://expressionflow.com/2009/11/04/worker-pool/comment-page-1/#comment-7029</link>
		<dc:creator>ahoenselaar</dc:creator>
		<pubDate>Thu, 01 Jul 2010 06:18:55 +0000</pubDate>
		<guid isPermaLink="false">http://expressionflow.com/?p=281#comment-7029</guid>
		<description>It seems like the final recursion depth is identical to the number of commands to be executed. The recursion depth in LabView is limited to 15,000 / 35,000 (32 bit / 64 bit versions), which will also limit the maximum number of jobs that can be processed.
Obviously, there are many trivial workarounds, but the generality of this design pattern strikes me as limited.

Still an interesting approach!</description>
		<content:encoded><![CDATA[<p>It seems like the final recursion depth is identical to the number of commands to be executed. The recursion depth in LabView is limited to 15,000 / 35,000 (32 bit / 64 bit versions), which will also limit the maximum number of jobs that can be processed.<br />
Obviously, there are many trivial workarounds, but the generality of this design pattern strikes me as limited.</p>
<p>Still an interesting approach!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Maila</title>
		<link>http://expressionflow.com/2009/11/04/worker-pool/comment-page-1/#comment-7024</link>
		<dc:creator>Tomi Maila</dc:creator>
		<pubDate>Sat, 19 Jun 2010 00:59:12 +0000</pubDate>
		<guid isPermaLink="false">http://expressionflow.com/?p=281#comment-7024</guid>
		<description>The downloads should now work, sorry for the delay.</description>
		<content:encoded><![CDATA[<p>The downloads should now work, sorry for the delay.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: eiskalterengel</title>
		<link>http://expressionflow.com/2009/11/04/worker-pool/comment-page-1/#comment-7019</link>
		<dc:creator>eiskalterengel</dc:creator>
		<pubDate>Mon, 07 Jun 2010 07:38:14 +0000</pubDate>
		<guid isPermaLink="false">http://expressionflow.com/?p=281#comment-7019</guid>
		<description>Hi all,

I already signed-up to ExpressionFlow to download this project, but I didn&#039;t find any possibilty to download this project.

Could anybody help me out?

Thanks very much
Bets regards</description>
		<content:encoded><![CDATA[<p>Hi all,</p>
<p>I already signed-up to ExpressionFlow to download this project, but I didn&#8217;t find any possibilty to download this project.</p>
<p>Could anybody help me out?</p>
<p>Thanks very much<br />
Bets regards</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Todd</title>
		<link>http://expressionflow.com/2009/11/04/worker-pool/comment-page-1/#comment-6983</link>
		<dc:creator>Todd</dc:creator>
		<pubDate>Sat, 19 Dec 2009 21:19:15 +0000</pubDate>
		<guid isPermaLink="false">http://expressionflow.com/?p=281#comment-6983</guid>
		<description>This is great stuff! Do you mind posting it on the NI Community (ni.com/community)?  I want to link to it from the news feed on the LabVIEW splash screen.  Send me an email when it&#039;s up and I&#039;ll push it live.</description>
		<content:encoded><![CDATA[<p>This is great stuff! Do you mind posting it on the NI Community (ni.com/community)?  I want to link to it from the news feed on the LabVIEW splash screen.  Send me an email when it&#8217;s up and I&#8217;ll push it live.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Maila</title>
		<link>http://expressionflow.com/2009/11/04/worker-pool/comment-page-1/#comment-6969</link>
		<dc:creator>Tomi Maila</dc:creator>
		<pubDate>Tue, 10 Nov 2009 18:24:15 +0000</pubDate>
		<guid isPermaLink="false">http://expressionflow.com/?p=281#comment-6969</guid>
		<description>I am pleased to make you happy :) I added an additional example implementation to the example code that reuses non-busy workers.</description>
		<content:encoded><![CDATA[<p>I am pleased to make you happy <img src='http://expressionflow.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  I added an additional example implementation to the example code that reuses non-busy workers.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: &#8211; Unlimited parallelism &#38; concurrency with recursive dataflowExpressionFlow</title>
		<link>http://expressionflow.com/2009/11/04/worker-pool/comment-page-1/#comment-6968</link>
		<dc:creator>&#8211; Unlimited parallelism &#38; concurrency with recursive dataflowExpressionFlow</dc:creator>
		<pubDate>Tue, 10 Nov 2009 16:09:18 +0000</pubDate>
		<guid isPermaLink="false">http://expressionflow.com/?p=281#comment-6968</guid>
		<description>[...] Worker pool &#8211; a design pattern for parallel task execution in LabVIEW  [...]</description>
		<content:encoded><![CDATA[<p>[...] Worker pool &#8211; a design pattern for parallel task execution in LabVIEW  [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 2mzu</title>
		<link>http://expressionflow.com/2009/11/04/worker-pool/comment-page-1/#comment-6967</link>
		<dc:creator>2mzu</dc:creator>
		<pubDate>Mon, 09 Nov 2009 16:50:04 +0000</pubDate>
		<guid isPermaLink="false">http://expressionflow.com/?p=281#comment-6967</guid>
		<description>Very elegant, unlike the (obvious) VI server solution (wrapping up Run VI invoke node in OO)  it runs with runtime, even with mobile module with 0 modification. Thanks.</description>
		<content:encoded><![CDATA[<p>Very elegant, unlike the (obvious) VI server solution (wrapping up Run VI invoke node in OO)  it runs with runtime, even with mobile module with 0 modification. Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jeffrey Habets</title>
		<link>http://expressionflow.com/2009/11/04/worker-pool/comment-page-1/#comment-6964</link>
		<dc:creator>Jeffrey Habets</dc:creator>
		<pubDate>Fri, 06 Nov 2009 16:33:38 +0000</pubDate>
		<guid isPermaLink="false">http://expressionflow.com/?p=281#comment-6964</guid>
		<description>Hi Tomi,

This is a very interesting implementation of an execution engine for the command design pattern. Thanks!

Jeffrey</description>
		<content:encoded><![CDATA[<p>Hi Tomi,</p>
<p>This is a very interesting implementation of an execution engine for the command design pattern. Thanks!</p>
<p>Jeffrey</p>
]]></content:encoded>
	</item>
</channel>
</rss>
