|
|
|
|
|
by hinkley
2644 days ago
|
|
Cliff Click (of JVM fame) did a presentation once on an open addressing hash table implementation that he believed was lock free (it used CAS and possibly some memory barriers). I wouldn't want to argue with Cliff Click on concurrency but everybody makes mistakes. I haven't checked back if anyone found any bugs yet. I'm also curious if or how that implementation would translate to other languages. What he did might not be declarable in the Rust ownership model. |
|