[concurrency-interest] ConcurrentHashMapV8

Adrian Tarau adrian.tarau at gmail.com
Fri Oct 7 11:23:21 EDT 2011


Hi Mark,

Are those implementations open source or closed source? I need a 
non-concurrent map which has minimum memory overhead per entry for a 
cache with small payloads(store a mapping between small strings).

Thanks,
Adrian Tarau.

On 10/07/2011 10:45 AM, Mark Thornton wrote:
> On 07/10/11 15:32, David M. Lloyd wrote:
>> Yeah, but I think that's not outside of what should be reasonably 
>> expected when you iterate a (non-COW) concurrent hash map.  As you 
>> say, hasNext()/next() can be made consistent by actually getting a 
>> snapshot ref to the next entry in hasNext(), but it doesn't have to 
>> be a copy of the Entry, it can still be the literal Entry in the map.
> I have several nonconcurrent map implementations which do not have 
> Entry instances internally --- they are created on the fly as needed 
> to satisfy the entrySet requirements. I usually do this where I can't 
> afford the space required by literal Entry instances.
>
> Mark Thornton
>
> _______________________________________________
> Concurrency-interest mailing list
> Concurrency-interest at cs.oswego.edu
> http://cs.oswego.edu/mailman/listinfo/concurrency-interest



More information about the Concurrency-interest mailing list