[infinispan-dev] Faster LRU

[Vladimir Blagojevic]

On 11-07-05 12:47 PM, Alex Kluge wrote:
> Hi,
>
>   I have a completely in-line limit on the cache entries built on a 
> clock cache that is an approximation to an LRU cache, and is extremely 
> fast (O(1)). It is not a strick LRU, but chooses a not recently used 
> item for removal. I'll provide some more details soon.
>
>   I'm not sure how far along you are, as some of this is in the future 
> tense, and some in the past. But I'll dig up this code - it's been a 
> while since I worked on the cache. :)
>
>                                                                        
> Alex
>
Alex,

I've seen references to clock algorithm in research literature. If you 
could adapt it to BCHM that would be great!

Thanks,
Vladimir
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.jboss.org/pipermail/infinispan-dev/attachments/20110705/58b18ae4/attachment.html