title: How to implement ConcurrentHashMap with features similar in LinkedHashMap?
body: <p>I have used <code>LinkedHashMap</code> with <code>accessOrder</code> 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. <code>ConcurrentHashMap</code> seems good in that regard, but lacks the features of <code>accessOrder</code> and <code>removeEldestEntry(Map.Entry e)</code> found in <code>LinkedHashMap</code>. Can anyone point to some link or help me to ease the implementation. </p>