<?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: Ehcache 1.6 2 Orders of Magnitude Faster</title>
	<atom:link href="http://gregluck.com/blog/archives/2009/02/ehcache-1-6-2-orders-of-magnitude-faster/feed/" rel="self" type="application/rss+xml" />
	<link>http://gregluck.com/blog/archives/2009/02/ehcache-1-6-2-orders-of-magnitude-faster/</link>
	<description>I am sick of simple. Things should be great!</description>
	<lastBuildDate>Thu, 09 Sep 2010 05:25:45 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: Manik Surtani</title>
		<link>http://gregluck.com/blog/archives/2009/02/ehcache-1-6-2-orders-of-magnitude-faster/comment-page-1/#comment-162</link>
		<dc:creator>Manik Surtani</dc:creator>
		<pubDate>Tue, 24 Feb 2009 00:52:44 +0000</pubDate>
		<guid isPermaLink="false">http://gregluck.com/blog/2009/02/ehcache-1-6-2-orders-of-magnitude-faster/#comment-162</guid>
		<description>Nice work Greg, impressive performance boosts.
&lt;p /&gt;
A point to note though, the charts you generated using the CacheBenchFwk uses an alpha release of JBC 3.0.0 - and specifically, one that predates any profiling/tuning.  You will find that the current JBC GA release - 3.0.3.GA - is significantly quicker than the alpha you tried.  Would be worth your while benching against this.
&lt;p /&gt;
Also, I tried running a few benchmarks of my own and noticed that EHCache-1.6.0-Beta3 - the current latest - was, if anything, a little slower than EHCache 1.5.0.  Did you use an unreleased snapshot of EHCache 1.6.0 in the tests above?
&lt;p /&gt;
Cheers
Manik
</description>
		<content:encoded><![CDATA[<p>Nice work Greg, impressive performance boosts.</p>
<p />
A point to note though, the charts you generated using the CacheBenchFwk uses an alpha release of JBC 3.0.0 &#8211; and specifically, one that predates any profiling/tuning.  You will find that the current JBC GA release &#8211; 3.0.3.GA &#8211; is significantly quicker than the alpha you tried.  Would be worth your while benching against this.</p>
<p />
Also, I tried running a few benchmarks of my own and noticed that EHCache-1.6.0-Beta3 &#8211; the current latest &#8211; was, if anything, a little slower than EHCache 1.5.0.  Did you use an unreleased snapshot of EHCache 1.6.0 in the tests above?</p>
<p />
Cheers<br />
Manik</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Greg Luck</title>
		<link>http://gregluck.com/blog/archives/2009/02/ehcache-1-6-2-orders-of-magnitude-faster/comment-page-1/#comment-161</link>
		<dc:creator>Greg Luck</dc:creator>
		<pubDate>Sun, 22 Feb 2009 10:47:37 +0000</pubDate>
		<guid isPermaLink="false">http://gregluck.com/blog/2009/02/ehcache-1-6-2-orders-of-magnitude-faster/#comment-161</guid>
		<description>Ari
j.u.c. allows me to fix some simple things. For example the Caches held by a CacheManager, and the listeners held by a Cache, I use CopyOnWriteArray or Set for. That is really great, because it means getting or iterating on those, which are very common, will never block.
But the most significant things are not j.u.c. I had a great contribution from Ben Manes and the new map class which holds elements is ConcurrentLinkedHashMap, which is not part of j.u.c. I do use ConcurrentLinkedHashMap for the LFU cache, as it takes a novel statistical sampling approach to selecting the element to evict which does require maintenance of _any_ ordering at all.
There are still a few wrinkles to work out in ConcurrentLinkedHashMap, and I am yet to rework DiskStore, but this is exciting stuff.
Greg
</description>
		<content:encoded><![CDATA[<p>Ari<br />
j.u.c. allows me to fix some simple things. For example the Caches held by a CacheManager, and the listeners held by a Cache, I use CopyOnWriteArray or Set for. That is really great, because it means getting or iterating on those, which are very common, will never block.<br />
But the most significant things are not j.u.c. I had a great contribution from Ben Manes and the new map class which holds elements is ConcurrentLinkedHashMap, which is not part of j.u.c. I do use ConcurrentLinkedHashMap for the LFU cache, as it takes a novel statistical sampling approach to selecting the element to evict which does require maintenance of _any_ ordering at all.<br />
There are still a few wrinkles to work out in ConcurrentLinkedHashMap, and I am yet to rework DiskStore, but this is exciting stuff.<br />
Greg</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ari Zilka</title>
		<link>http://gregluck.com/blog/archives/2009/02/ehcache-1-6-2-orders-of-magnitude-faster/comment-page-1/#comment-160</link>
		<dc:creator>Ari Zilka</dc:creator>
		<pubDate>Sun, 22 Feb 2009 02:47:34 +0000</pubDate>
		<guid isPermaLink="false">http://gregluck.com/blog/2009/02/ehcache-1-6-2-orders-of-magnitude-faster/#comment-160</guid>
		<description>Great post Greg!  Lovin&#039; util.concurrent.
</description>
		<content:encoded><![CDATA[<p>Great post Greg!  Lovin&#8217; util.concurrent.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
