Original post is here: eklausmeier.goip.de
Peter Kankowski wrote a very interesting article on hashing functions. It compares a number of current hash functions and conducts some performance benchmarks.
- iSCSI CRC
- Meiyan
- Murmur2
- XXHfast32
- SBox (dead link: https://home.comcast.net/~bretm/hash/10.html)
- Larson
- XXHstrong32
- Sedgewick
- Novak unrolled
- CRC-32
- Murmur3
- x65599
- FNV (Fowler–Noll–Vo) hash
- Murmur2A
- Fletcher
- Kernighan & Ritchie
- Paul Hsieh
- Bernstein
- x17 unrolled
- lookup3
- MaPrime2c
- Ramakrishna
- One At Time
- Arash Partow
- Weinberger
- Hanson
A more complicated algorithm does not necessarily mean better performance. So the classical Kernighan & Ritchie hash still performs quite well.