[concurrency-interest] A Fast Wait-Free HashTable
kimo at webnetic.net
Thu Feb 22 01:38:59 EST 2007
Go here for slides of the talk.
From: concurrency-interest-bounces at cs.oswego.edu [mailto:concurrency-interest-bounces at cs.oswego.edu] On Behalf Of Joseph Seigh
Sent: 2007 February 21 17:57
Subject: Re: [concurrency-interest] A Fast Wait-Free HashTable
David J. Biesack wrote:
>Does anyone know more about Cliff Click's wait-free hashtable?
>"A Faster Wait-Free Hash Table"
>"I present a wait-free (lock-free) concurrent Hash Table implementation with better single-thread performance than most Hash Tables, and better (usual much better) multi-thread performance than all other implementations I tried. I demonstrate scaling up to 768 CPUs even with high mutation rates. I show correctness by looking at the problem in a very different light than the usual "happens-before" / memory-order / fencing style of thinking -- indeed the algorithm requires no memory-ordering, no memory fencing, no D-CAS and no CAS-spin-loops."
>Sounds interesting. Has anyone seen or reviewed the design or implementation, or comparisons to ConcurrentHashMap?
No. I guess we'll have to wait for the wait-free hash table. :)
I sort of have a blocking linked list which runs about 3X faster than LinkedBlockingQueue under high contention on a single processor system. I am waiting for a
system to test how well it will really scale.
Concurrency-interest mailing list
Concurrency-interest at altair.cs.oswego.edu
More information about the Concurrency-interest