ALL > Computer and Education > courses > university courses > undergraduate courses > Operating System > CLASS (2016-2017-1)-62903-06102-1 > 2014329620077_陆梦丽 > 9.13 >
9.13 Version 0
👤 Author: by 2014329620077ll 2016-12-21 14:41:51
9.13
a.
1. 0
2. Whenever a new page is associated with that frame.
3. Whenever one of the pages associated with that frame is no longer required
4. Find a frame with the smallest counter. Use FIFO for breaking ties.
b. 14 page faults
c. 11 page faults


Using a circular queue to avoid moving data in a FIFO queue.When a page fault occurs, the page the hand is pointing to is inspected.

Please login to reply. Login

Reversion History

Loading...
No reversions found.