Recent questions tagged page-faults

A demand-paging system has $3$ physical page frames.Consider the reference string:$\text{A, B, C, D, B, A, B, A, D, C}$Starting with empty memory, determine the total num...

A system uses:$4$ KB pages A $4$-entry fully associative TLB LRU replacement $$ \textbf{Initial TLB:} $$$$\begin{array}{|c|c|c|c|}\hline\text{Valid} & \text{VPN} & \text{...

A machine uses a two-level page table. The page-directory base address is held in a register.Assume:One physical-memory access takes $100$ ns Page directories and page ta...

A paged virtual-memory system has the following measured parameters:\[\begin{array}{|l|l|}\hline\textbf{Measurement} & \textbf{Value} \\\hlineP_t = \text{probability of a...

Consider the following page-reference string:$1,\ 2,\ 3,\ 4,\ 1,\ 2,\ 5,\ 1,\ 2,\ 3,\ 4,\ 5$The FIFO page-replacement algorithm is used with $\textbf{4}$ page frames.Init...

A system makes an average of $2$ main-memory accesses per instruction.Whenever a page fault occurs, it causes an overhead of $40$ millisecondsWhat is the maximum allowabl...

If an instruction takes $p$ microseconds and a page fault takes an additional $q$ microseconds, the effective instruction time if, on average, a page fault occurs every $...

Consider the following page address trace generated by a cache main memory scheme and has a cache capacity of four pages:1,6, 4,5, 1, 4, 3, 2, 1, 2, 1, 4, 6, 7, 4Assuming...

Consider the cache of size 512 bytes that is direct-mapped?Suppose the size of integer is 4 bytes and block size is 16 bytes. Assume cache is initially empty and all data...

On a system using demand paging, it takes 200 ns to satisfy a memory request if the page is in memory. If the page is not in memory, the request takes 7 ms if a free fram...

Compute the hit rate and miss/fault rate in least recently used page replacement algorithm for the given reference string with $4$ page frames. String: $7 \; 0 \; 1 \; 2 ...