Daniel Ellard, Margo Seltzer.
NFS Tricks and Benchmarking Traps
(PDF,
HTML)
Published in the proceedings of the
FREENIX Technical Conference,
San Antonio, Texas. June 2003.
The two changes are to increase NUM_HEURISTIC, and increase the number of probes attempted before a search of the table is abandoned. You could make the max probes as high as NUM_HEURISTIC, if you want to trade time for space. My choice of constants is arbitrary; maybe they should be config options so people with really big servers can set it to whatever they like when they build their kernels.
Along with this is a change in the hash function that's needed if NUM_HEURISTIC isn't a power of two (the current code uses a bitmask to compute mod NUM_HEURISTIC).
The changes are easier to see as a context diff from the original 4.6.2p4 source.
The changes are easier to see as a context diff from the original 4.6.2p4 source.