placeholder

Relativistic hash tables, part 1: Algorithms [LWN.net]

One might wonder whether the resizing of hash tables is common enough to be worth optimizing. As it turns out, picking the correct size for a hash table is not easy; the kernel has many tables whose size is determined at system initialization time with a combination of heuristics and simple guesswor…

Click to view the original at lwn.net