I take it back. I tried putting random table hash functions into my
BDD code, and got slower results than the existing multiplicative
hashes. It appears that the bucket distribution didn't improve much
at all, and as you point out, computing the hash function is slow.
The loads don't appear to be the problem: most of the work is in
unpacking the bytes, which turns out to be more work than the multiply.
Bottom line: random table hash function is slower than multiplicative
hash function, bucket distribution is no better, so its a loss.
Sorry for the distraction.
-Iain
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/