The other point is that TLB misses can be satisfied with a single cache line fill. Or that is the theory, as told to me by a big inverted page table advocate a

The other point is that TLB misses can be satisfied with a single cache line fill. Or that is the theory, as told to me by a big inverted page table advocate a couple of years before of Linus's comments. Personally, I tend to favor Linus's perspective. Particularly because making an optimal decision about how large the page table hash is, turns out to be pretty hard to do at runtime. Changing the size is even harder. This means that you either waste a lot of unnecessarily memory on the inverted tables, or you tend to take excessive page table misses, and waste a lot more than 3 cache line fills satisfying them.