[concurrency-interest] Concurrent approximate LRU?

Kevin Bourrillion kevinb at google.com
Sat Nov 7 12:44:24 EST 2009

Also, we're working actively to add support for bounded caches to MapMaker:


We are investigating a fuzzy-LRU strategy, as well as ClockPro, which
seems very promising so far:


This is a refinement of LIRS (it can help to read this one first, perhaps):


We'd love to hear any reactions to, or particularly experience with,
LIRS and ClockPro.

On Sat, Nov 7, 2009 at 5:04 AM, Tim Peierls <tim at peierls.net> wrote:
> On Sat, Nov 7, 2009 at 6:28 AM, Sanne Grinovero <sanne.grinovero at gmail.com>
> wrote:
>> I don't know the details of the implementation but Infinispan is
>> doing something similar; ...
>> It implements "ConcurrentHashMap" so it should be straight-forward to drop
>> in.
> Infinispan's Cache<K, V> extends ConcurrentMap<K, V>.  (ConcurrentHashMap is
> a concrete type.)
> --tim
> _______________________________________________
> Concurrency-interest mailing list
> Concurrency-interest at cs.oswego.edu
> http://cs.oswego.edu/mailman/listinfo/concurrency-interest

Kevin Bourrillion @ Google
internal:  http://go/javalibraries
external: guava-libraries.googlecode.com

More information about the Concurrency-interest mailing list