Alex Rivera | Logout

How to implement ConcurrentHashMap with features similar in LinkedHashMap?

Asked 2009-11-29T14:17:52.660
18

I have used LinkedHashMap with accessOrder true along with allowing a maximum of 500 entries at any time as the LRU cache for data. But due to scalability issues I want to move on to some thread-safe alternative. ConcurrentHashMap seems good in that regard, but lacks the features of accessOrder and removeEldestEntry(Map.Entry e) found in LinkedHashMap. Can anyone point to some link or help me to ease the implementation.

java performance multithreading concurrenthashmap linkedhashmap
Edit
Report

1 Answer

-2

Wrap the map in a Collections.synchronizedMap(). If you need to call additional methods, then synchronize on the map that you got back from this call, and invoke the original method on the original map (see the javadocs for an example). The same applies when you iterate over the keys, etc.

answered 2009-11-29T14:26:15.687

Your Answer