Given that main memory is composed ot only three page trames tor public use. and that a seven-page program (with pages a, b, c, d, e, t, g) requests pages in the tolowing order: a, b, c, b, d, a, e, t, b, e, d. answer the following questions. Using the FIFO page removal algorithm, indicate the movement of the pages into and out of the available page frames (called a page trace analysis), indicating each page fault with an asterisk (" ). I hen compute the failure ratio and success ratio. Using FIFO again, increase the size of memory so that it contains tour page frames tor public use. Using the same page requests as above, do another page trace analysis and compute the tailure and success ratios What general statement can you make trom this example? Explain your answer
Given that main memory is composed ot only three page trames tor public use.
and that a seven-page program (with pages a, b, c, d, e, t, g) requests pages in
the tolowing order:
a, b, c, b, d, a, e, t, b, e, d.
answer the following questions.
Using the FIFO page removal
pages into and out of the available page frames (called a page trace
analysis), indicating
each page fault with an asterisk (" ). I hen compute the
failure ratio and success ratio.
Using FIFO again, increase the size of memory so that it contains tour page
frames tor
public use. Using the same page requests as above, do another
page trace analysis and compute the tailure and success ratios
What general statement can you make trom this example? Explain your answer
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
