hms: a. Optimal page replacement b. FIFO page replacement c. LRU page replacement In each cases show a diagram (ASCII art recommended) that shows which pages are in which frames throughout time, and page faults at the bottom. For instance: would mean that at step 1 page 0 is referenced and loaded into frame 0, which is a page fault; then page 1 is referenced, and so on. The goal is to fill this table to see what in memory when and thus infer the number of page faults.
Consider a system with four page frames and a program that uses eight pages. Consider the reference string 0 1 7 2 0 3 1 7 0 1 7 and assume that all four page frames are initially empty. Consider the three following
-
a. Optimal page replacement
-
b. FIFO page replacement
-
c. LRU page replacement
In each cases show a diagram (ASCII art recommended) that shows which pages are in which frames throughout time, and page faults at the bottom. For instance:
would mean that at step 1 page 0 is referenced and loaded into frame 0, which is a page fault; then page 1 is referenced, and so on. The goal is to fill this table to see what in memory when and thus infer the number of page faults.
The first 4 steps are ALWAYS the same, as above (i.e., just fill the four frames, with one page fault each time)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
