[concurrency-interest] FooTreeCache

Hanson Char hanson.char at gmail.com
Fri Aug 25 04:29:02 EDT 2006

Yes, thanks for the pointer.  David Holmes also made the same point.
Will look into replacing the use of the ReadWriteLock+SortedMap with a

However, the need for the volatile and AtomicReference in FooTreeCache
will still hold.

Any problem anyone can spot ?

Hanson Char

On 8/25/06, Kasper Nielsen <kav at it.edu> wrote:
> Hanson Char wrote:
> > Hi,
> >
> > For some reason I need to cache a large but bounded number of of items
> > in a SortedMap and be able to preload the cache concurrently (ie
> > without significantly impacting the handling of service requests.)
> > Actually the closes thing I need is probably ConcurrentSkipListMap in
> > Java 6, but suffice to say I can't use it yet.
> The source is released to the public domain, so why don't use it? I
> think ConcurrentSkipListMap will only need minor changes to compile on
> 5.0. (missing interfaces etc.)
> - Kasper

More information about the Concurrency-interest mailing list