JBCACHE-1157 changes the HashMap used in an UnversionedNode to a ConcurrentHashMap, which
makes an empty node take about 1.3K to store, from about 150 bytes. To do this sort of
change on 1.4 might affect people's runtime memory usage quite a bit. For 2.0, I
don't know. A cache that has so much overhead sort of bothers me.
Perhaps with a "global" NavigableMap (backported from 1.6), you could store all
the data in a single flat map, with the following techniques:
1. Node.put(k, v) -> NM.put(new Pair(Fqn, k), v)
2. Node.getMap() -> NM.getRange(new Pair(Fqn, FirstKey), new Pair(Fqn, LastKey));
The main downside is that all operations are of course slower, depending on how the Fqn is
constructed. (A Fqn is much faster than Fqn).
View the original post :
http://www.jboss.com/index.html?module=bb&op=viewtopic&p=4068969#...
Reply to the post :
http://www.jboss.com/index.html?module=bb&op=posting&mode=reply&a...