<?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: German Article: Java EE Scheduler mit skalierender Verarbeitung</title>
	<atom:link href="http://teamzone.ch/2009/09/02/german-article-java-ee-scheduler-mit-skalierender-verarbeitung/feed/" rel="self" type="application/rss+xml" />
	<link>http://teamzone.ch/2009/09/02/german-article-java-ee-scheduler-mit-skalierender-verarbeitung/</link>
	<description>Welcome to the Joint-Venture Blog from Fabio Cortesi and Stefan Jäger.</description>
	<lastBuildDate>Fri, 20 May 2011 09:53:36 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2</generator>
	<item>
		<title>By: Stefan Jäger</title>
		<link>http://teamzone.ch/2009/09/02/german-article-java-ee-scheduler-mit-skalierender-verarbeitung/comment-page-1/#comment-154</link>
		<dc:creator>Stefan Jäger</dc:creator>
		<pubDate>Thu, 03 Sep 2009 19:27:48 +0000</pubDate>
		<guid isPermaLink="false">http://teamzone.ch/?p=486#comment-154</guid>
		<description>Unfortunately, there isn&#039;t a English version available. 

But if you look at the picture at the first page, you see the whole principle. There is a job queue, where all applications can register new jobs (with a timestamp, an identification and a &quot;worker queue&quot;). The job gets stored and an EJB polls this table. If a job is expired, it send it to its &quot;worker queue&quot;. The MDB at this queue is able to read the identification and can perform a task for it. That&#039;s it :-)

The second part covers the ability for a failover in a cluster environment.</description>
		<content:encoded><![CDATA[<p>Unfortunately, there isn&#8217;t a English version available. </p>
<p>But if you look at the picture at the first page, you see the whole principle. There is a job queue, where all applications can register new jobs (with a timestamp, an identification and a &#8220;worker queue&#8221;). The job gets stored and an EJB polls this table. If a job is expired, it send it to its &#8220;worker queue&#8221;. The MDB at this queue is able to read the identification and can perform a task for it. That&#8217;s it <img src='http://teamzone.ch/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
<p>The second part covers the ability for a failover in a cluster environment.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sumanth</title>
		<link>http://teamzone.ch/2009/09/02/german-article-java-ee-scheduler-mit-skalierender-verarbeitung/comment-page-1/#comment-153</link>
		<dc:creator>Sumanth</dc:creator>
		<pubDate>Thu, 03 Sep 2009 17:08:59 +0000</pubDate>
		<guid isPermaLink="false">http://teamzone.ch/?p=486#comment-153</guid>
		<description>If there is an english version of it available, please send it across.</description>
		<content:encoded><![CDATA[<p>If there is an english version of it available, please send it across.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

