[concurrency-interest] How to implement a self populating memoizer cache?

Dhanji R. Prasanna dhanji at gmail.com
Wed Nov 3 08:18:48 EDT 2010


Take a look at the implementation of MapMaker from guava libraries. That
should give you some ideas too.

Dhanji.

On Wed, Nov 3, 2010 at 8:07 PM, Nader Aeinehchi <nader at aeinehchi.com> wrote:

> Hello
>
> How can a self populating cache be implemented?
>
> Requirements:
>
> 1. the put(key,value) operation will be a memoizer (value =
> computer(computable)) where computable==key.
> 2. how can a remove operation be implemented?
> 3. the cache will be thread safe
> 4. the cache will have a good performance for up to upper medium contention
> (i.e. very high contention is not required)
> 5. preferrably a non-blocking algorithm
> 6. no need for timers,....
>
> In advance, thank you very much.
>
> _______________________________________________
> Concurrency-interest mailing list
> Concurrency-interest at cs.oswego.edu
> http://cs.oswego.edu/mailman/listinfo/concurrency-interest
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20101103/5801f6b0/attachment.html>


More information about the Concurrency-interest mailing list