For those interested in the subject: Cliff Click of Azul Systems had a presentation on his design for a hash table meant for heavy multithreading. One part I remember was that he stored the hashes of keys alongside the keys, allowing for faster resolution of the "not match" case (you compare the hashes before doing the full key comparison).
https://web.stanford.edu/class/ee380/Abstracts/070221_LockFr...
While searching for the above, I also found this: http://preshing.com/20130605/the-worlds-simplest-lock-free-h...