I am given a system using a 16-bit Von Neumann architecture that has a page size of 2,048 bytes and 6 KB of RAM memory. Access to the pages of the system is happening in the following order:
4, 3, 2, 4, 4, 1, 10, 11, 5, 3, 5, 4, 1, 2, 6, 12, 1, 5, 0, 11, 3, 4, 1, 2, 2, 1, 0, 7, 6, 5,
3, 1, 4, 5, 2, 2, 6, 7
a) What is the total number of virtual pages and page frames in this system?
b) How many page faults are issued when using the FIFO and algorithm for the accesses above?
c) Describe the memory mapping of the pages at moment 10 in the scenario above
d)Considering that at moment 11 you are accessing the virtual address 0xB0BB, what is its corresponding page frame?
a)Our physical memory of 6KB would be 3*2^11 bytes
Our page size is 2048 bytes=2^11 bytes
So we should have 3*2^11/2^11=3 page frames
And also 3^16/2^11=2^5=32 virtual pages.
I think this should be correct.
For b) it should be just a standard application of FIFO
For c) is moment 0 the moment when the page frames are empty, and then moment 1 is when page 4 is accesed? If so then at Moment 10 we should have 5,3 and 11 in the frames.
For d) is where i dont exactly understand what needs to be done
How can we find the corresponding page frame for that address in this example and in general?