Sometime back I looked at the code to find that out. Following is the result. There will be some additional overhead for internal DS for ConcurrentLinkedHashMap.
<Keycache size> * (<8 bytes for position i.e. value> + <X bytes for key> + <16 bytes for token (RP)> + <8 byte reference for DecoratedKey> + <8 bytes for descriptor reference>) Thanks, Naren On Mon, Mar 14, 2011 at 1:29 PM, ruslan usifov <ruslan.usi...@gmail.com>wrote: > Hello > > > How is it possible calculate this value? I think that key size, if we use > RandomPartitioner will 16 bytes so keycache will took 16*(num of keycache > elements) bytes ?? >
