Consider the following program: Assume that an integer occupies a word. Arrays A

Question

Consider the following program: Assume that an integer occupies a word. Arrays A and B are split up into pages such that a page holds elements of A or B. Main memory can hold two pages of 100 words each. Assume that the code and variable I are placed in another page frame and no instruction fetch or access to variable I produces a page fault; also assume the presence of a register to hold temporary values. Also assume that main memory is initially empty. Show the page reference string Compute the number of page faults generated by the program for two cases The FIFO page replacement policy, MIN (The Optimal) page replacement policy. The problem is not difficult, but make sure you look at what happens when A[5GG] (or thereabouts) is referenced; otherwise your answer will be off by a few page faults.

Explanation / Answer

a)Page Reference strings A:500,100,200,4568,782,851,500

B:500,200,100,456,857

b)FIFO page replacement

make use of recent page replacement.

min =10

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---