Userland allocators already work pretty hard to hit in the TLB [1], but huge-page tuning and whatnot is, to your point, only hitting the sweet spot on modern gear via effort/luck.
[1] https://engineering.fb.com/2011/01/03/core-data/scalable-mem...
Userland allocators already work pretty hard to hit in the TLB [1], but huge-page tuning and whatnot is, to your point, only hitting the sweet spot on modern gear via effort/luck.
[1] https://engineering.fb.com/2011/01/03/core-data/scalable-mem...
One size almost never fits all, as I’m sure you’ll agree as someone who cares about compiling the kernel.
With that said, the kernel is pretty good at reclaiming physical pages, so you’d most likely eat into the same disk cache you’re reading from in the scenario you’ve described.
CHERI has shown that this kind of fundamental architectural improvements can happen with very little impact to running code.
If you’re promoting computer architecture and OS research, have at it, needs doing.
But that’s a different game to running software on the architectures, operating systems, and tool chains we have today.