so it turns out that knuth hash is the same as not hashing at all. Because the input is a random number from a fixed range, and I'm getting the hash index by masking the lower bits nothing much is going to improve the distribution.
These also overlap, so if you do multiple hashes at the same time, it goes from 1 byte per cycle to 4 bytes per cycle.
-
-
thanks! I'll take a look.
-
My recommendation to people is usually that if you can afford AESNI, try doing basically this routine but with only 2 aesdecs, and test the histogram for your data. If it's "good enough", then you're done. If it's not, add two more (like the routine given), and THEN you're done.
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.