<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.7.3" -->
<rss version="2.0">
	<channel>
		<title>Intro to Caching,Caching algorithms and caching frameworks part 2 </title>
		<description>Comments for Intro to Caching,Caching algorithms and caching frameworks part 2  at http://www.jtraining.com , comment 1 to 3 out of 3 comments</description>
		<link>http://www.jtraining.com</link>
		<lastBuildDate>Tue, 07 Sep 2010 03:42:45 +0100</lastBuildDate>
        <generator>FeedCreator 1.7.3</generator>
		<item>
			<title>...</title>
			<link>http://www.jtraining.com/blogs/intro-to-caching-caching-algorithms-and-caching-frameworks-part-2.html#comment-27</link>
			<description>David,

HAC and ARC when i mentioed framework i meant replacement policy sorry for the confuse i caused :) (i should have stated it in a better way :) ) - sneake75@hotmail.com</description>
			<pubDate>Thu, 06 Aug 2009 23:40:21 +0100</pubDate>
		</item>
		<item>
			<title>...</title>
			<link>http://www.jtraining.com/blogs/intro-to-caching-caching-algorithms-and-caching-frameworks-part-2.html#comment-25</link>
			<description>David,

self-optimizing caching frameworks do exist , in part 1 i mentioned one of these frameworks Adaptive Replacement Cache (ARC)  which is a self tuning cache framework there are also some other caching frameworks like HAC (Hybrid Adaptive Caching) and many other some of these frameworks use AI techniques like 'Machine Learning' algorithms to enable the application itself to select an algorithm from a pool of algorithms based on what the machine has learned and some other frameworks don’t use such advanced technique and instead just switch between two algorithms based on a specific criteria in the cached object itself (like for example the frequency of usage or recency of the item)

As for the overhead it is not that much (most of these frameworks are build with low overhead algorithms as this is the main challenge when building such framework)

Hope this would answer your question :) and stay tuned for part 3 ;)

 - sneake75@hotmail.com</description>
			<pubDate>Sat, 01 Aug 2009 16:11:04 +0100</pubDate>
		</item>
		<item>
			<title>...</title>
			<link>http://www.jtraining.com/blogs/intro-to-caching-caching-algorithms-and-caching-frameworks-part-2.html#comment-24</link>
			<description>Do any 'self-optimizing' caching frameworks exist today? So, for instance, it starts with LRU and then the framework monitors the use of the cache and depending on the miss/hit rates and other information switches the algorithm accordingly??? That would be quite handy 38). An 'install and forget' kind of caching framework. Not sure if the monitoring would mean more overhead and then loose (some of) the benefit of caching.... Or would that be in part 3? - david</description>
			<pubDate>Sat, 01 Aug 2009 01:22:06 +0100</pubDate>
		</item>
	</channel>
</rss>
