Page Table Memory Consumption
Fernando Simões Page table memory consumption Oct 1, 2026 The other day I was reading Linus Torvalds punch some people over hashed page tables. His argument: in a tree, the entries of neighboring pages are adjacent, which means one cache-line fills several TLB entries at once. A hash table, on the other hand, scatters neighbors in buckets: The fact is, you just don’t know what GOOD actually is. I’ll tell you: t a good TLB fill should pre-populate the TLB with all the entries it can f
Read full article →