[concurrency-interest] ConcurrentHashMapV8

David M. Lloyd david.lloyd at redhat.com
Thu Oct 6 19:09:51 EDT 2011

On 10/06/2011 04:39 PM, David M. Lloyd wrote:
> In one of my scratchpads I have a lockless* ConcurrentMap which does
> exactly this (have its entries implement Entry, that is) implemented in
> terms of an atomic ref array of (immutable) arrays of entries. I hope to
> have time to run it through some more testing in the next couple weeks,
> to see how it compares with what's on the table. So it's at least
> possible... we'll see about practical. :)
> The other extreme is the copy-on-write type of map where an iterator
> would reflect a snapshot and Entries would be immutable. But this is
> also easy to make well-defined for an arbitrary lifespan.
> * well, okay, it does lock to block writers during resize, so it's not
> 100% lockless.

I put this up in 
https://github.com/dmlloyd/experimental-crap/branches/hashmaps if anyone 
is interested, or just wants a good laugh.


More information about the Concurrency-interest mailing list