Hi all, I have released http://bei.bof.de/cttest-0.2.tar.gz. It is now easier to modify the list of sizes and hashes that should be plotted, and there's timing code for the hash functions, together with average used list length analysis.
> Actually, I now have this nice <128-byte-icache snippet which computes the > next-smaller-prime, given any 32 bit unsigned. And it's fast. If somebody wants to review this code, have a look at cttest-0.2/prime.c The pictures at http://bei.bof.de/ex1/ have been updated to the produce of cttest-0.2. I'd like to see some runs from Athlon and Pentium4 systems, to compare the hash function timings. best regards Patrick
