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

Nader Aeinehchi nader at aeinehchi.com
Wed Nov 3 07:31:57 EDT 2010


Would you kindly refer more specifically to which part of the book?

Thanks

Nader Aeinehchi



On 11/03/2010 10:40 AM, fabo wang wrote:
> the book《Java Concurrency in Practice》give a simple solution.
>
>
>
> 2010/11/3 Nader Aeinehchi <nader at aeinehchi.com
> <mailto:nader at aeinehchi.com>>
>
>     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
>     <mailto:Concurrency-interest at cs.oswego.edu>
>     http://cs.oswego.edu/mailman/listinfo/concurrency-interest
>
>
>
>
> -- 
> computer science踢球者
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20101103/ac296647/attachment.html>


More information about the Concurrency-interest mailing list