I've created an UnBoundedLRUMap implementation (based off of BoundedLRUMap) using the svn tree at version 3.3, and this has come in so handy that it makes sense to suggest it to the masters in charge of the collections framework.
One tweak I made to the copy we're using is an extra get method that takes two arguments: key and boolean. The boolean determines whether or not the MRU item is updated, so we can make requests into the map that do not affect order. This is sometimes necessary in real world environments where you do not want a data structure with LRU-only accesses.
This implementation would solve the main problem we have with using the jdk's LinkedHashMap LRU implementation.