684 views
1 votes
1 votes
Consider a paging system with the page table stored in memory.

a. If a memory reference takes 50 nanoseconds, how long does a paged memory reference take ?

b. If we add $TLBs$, and 75 percent of all page-table references are found in the $TLBs$, what is the effective memory reference time ? (Assume that finding a page-table entry in the $TLBs$ takes 2 nanoseconds, if the entry is present.)

1 Answer

Related questions

1 votes
1 votes
1 answer
2
akash.dinkar12 asked Mar 21, 2019
2,117 views
Compare the segmented paging scheme with the hashed page table scheme for handling large address spaces. Under what circumstances is one scheme preferable to the other ?
0 votes
0 votes
0 answers
3
akash.dinkar12 asked Mar 21, 2019
241 views
Consider the hierarchical paging scheme used by the $VAX$ architecture. How many memory operations are performed when a user program executes a memory-load operation ?
0 votes
0 votes
1 answer
4