On Tue, Jul 5, 2011 at 7:47 PM, Alex Kluge <java_kl...@yahoo.com> 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. :) > This sounds great Alex. We're not strictly LRU either because the policy is enforced at the map segment level, so we don't always evict the oldest element in the map. Maybe you also have a good cache/eviction policy test? ;-) Cheers Dan
_______________________________________________ infinispan-dev mailing list infinispan-dev@lists.jboss.org https://lists.jboss.org/mailman/listinfo/infinispan-dev
