Transcription of Paging: Faster Translations (TLBs)
{{id}} {{{paragraph}}}
19 paging : Faster Translations (TLBs)Using paging as the core mechanism to support virtual memory canleadto high performance overheads. By chopping the address space into small,fixed-sized units ( , pages), paging requires a large amount of mappinginformation. Because that mapping information is generally stored inphysical memory, paging logically requires an extra memory lookup foreach virtual address generated by the program. Going to memory fortranslation information before every instruction fetch or explicit load orstore is prohibitively slow. And thus our problem:THECRUX:HOWTOSPEEDUPADDRESSTRANS LATIONHow can we speed up address translation , and generally avoid theextra memory reference that paging seems to require?
PAGING: FASTER TRANSLATIONS (TLBS) 3 The TLB, like all caches, is built on the premise that in the common case, translations are found in the cache (i.e., are hits). If so, little over-
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}