🚀 go-pugleaf

In article <29718@brunix.UUCP> phg@cs.brown.edu (Peter H. Golde) writes:
>One might note that implementing a 64-bit address space
>with 64 KB pages and 8 bytes/page in the page table requires
>2 billion megabytes of page-table space.  Hmmmmm.....
	This is for the final level of the translation, and it need not be
fully resident (!).  With each successive (K step) indirection you'd add
2^(64 - 13*k) { 1 <= K <= 4 } bytes in page tables.  Only the highest
level (lowest K) need be loaded.  However, you do buy the space with time
(successive look-ups).  

	What's the general feeling on future page sizes (I'm guessing that
64K was picked here to make the page-tables smaller)?  Is it reasonable
to assume that they are going to increase also (as bandwidth/latency
increases), or will we lose more by making pages larger?  

							Anand.  

--
"Surely you're not happy, you no longer play the game..."
{inter | bit}net: iyengar@eniac.seas.upenn.edu
uucp: !$ | uunet
--- Lbh guvax znlor vg'yy ybbx orggre ebg-guvegrrarg? ---