3 ms·
MurmurHash3 (http://code.google.com/p/smhasher/wiki/MurmurHash3 http://code.google.com/p/smhasher/wiki/MurmurHash3), CityHash (http://code.google.com/p/cityhash
by haberman 14y ago
MurmurHash3 (http://code.google.com/p/smhasher/wiki/MurmurHash3 http://code.google.com/p/smhasher/wiki/MurmurHash3), CityHash (http://code.google.com/p/cityhash/ http://code.google.com/p/cityhash/), SpookyHash (http://burtleburtle.net/bob/hash/spooky.html http://burtleburtle.net/bob/hash/spooky.html).
- dchest 14y agoBut you said 16 cycles. "For example, hashing 16 bytes takes 141 Bulldozer cycles with SipHash-2-4, against 82 and 126 for CityHash and SpookyHash, and 600 for MD5." https://www.131002.net/siphash/siphash.pdf https://www.131002.net/siphash/siphash.pdf (p.12)
- haberman 14y agoAccording to CityHash's benchmarks (http://code.google.com/p/cityhash/source/browse/trunk/README http://code.google.com/p/cityhash/source/browse/trunk/README), they can hash 8 bytes in 6ns and 64 bytes in 9ns on a 2.67GHz machine (so 16-24 cycles).