Exercise $5$

Consider a paging system with the page table stored in memory.

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

b$.$ If we add associative registers, and $80$ percent of all page$-$table references are found in the associative registers, what is the effective memory reference time? $($Assume that finding a page$-$table entry in the associative registers takes zero time, if the entry is there.$)$

Answer:

Exercise $6$

Consider the following page reference string:

$1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6.$

Used in e$-$frame memory space. How many page faults would occur for the following replacement algorithms:

FIFO

Optimal

$$ LRU $($use a stack$)$