587 views

The following page addresses, in the given sequence, were generated by a program:

$\text{1 2 3 4 1 3 5 2 1 5 4 3 2 3}$

This program is run on a demand paged virtual memory system, with main memory size equal to $4$ pages. Indicate the page references for which page faults occur for the following page replacement algorithms.

1. LRU
2. FIFO

Assume that the main memory is initially empty

edited | 587 views

LRU :  $1,2,3,4,5,2,4,3,2$
FIFO : $1,2,3,4,5,1,2,3$
edited by
+6

Also number of page faults:

LRU: 9

FIFO: 8

1
2