. Let’s say a program has 1010 bytes and will be loaded into page frames of 256 bytes each, assuming the job begins loading at the first page (Page 0) in memory, and the instruction to be used is at Byte 577, answer the following questions:
a. How many pages are needed to store the entire job?
b. Compute the page number and exact displacement for the byte addresses where the data is stored.
. Given that main memory is composed of only three page frames for public use, and that a seven-page program (with pages a, b, c, d, e, f, g) requests pages in the following order: a, b, c, b, d, a, e, f, b, e, d, f answer the following questions.
a. 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 (*). Then compute the failure ratio and success ratio.
b. Using FIFO again, increase the size of memory so that it contains four page frames for public use. Using the same page requests as above, do another page trace analysis and compute the failure and success ratios.
c. What general statement can you make from this example?
Explain your answer.
. Given that main memory is composed of only three page frames for public use, and that a program requests pages in the following order: a, c, b, d, a, c, e, a, c, b, d, e answer the following questions.
a. 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 (*). Then compute the failure and success ratios. Copyright 2018 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. WCN 02-200-203 98Chapter 3 | Memory Management Includes Virtual Memory
b. Increase the size of memory so it contains four page frames for public use. Using the same page requests as above and FIFO, do another page trace analysis and compute the failure and success ratios.
c. What general statement can you make from this example? Explain your answer
. Given that main memory is composed of three page frames for public use, and that a program requests pages in the following order: a, b, a, b, f, d, f, c, g, f, g, b, d, e answer the following questions.
a. Using the FIFO page removal algorithm, perform a page trace analysis indicating page faults with asterisks (*). Then compute the failure and success ratios.
b. Using the LRU page removal algorithm, perform a page trace analysis and compute the failure and success ratios.
c. What conclusions do you draw from this comparison of FIFO and LRU performance?
Would you make general statements from this example?
Explain why or why not. 10. Let us define “most recently used” (MRU) as a page removal algorithm that removes from memory the most recently used page. Perform a page trace analysis using page requests from the previous exercise for a system with three available page frames, and again with six available page frames.
.
