操作系统Chapter08_OSVirtual Memory幻灯片课件.ppt

Page Replacement: Basic Scheme How to select a reference string (real recorded data or simulated data) How to reduce the number of data Just consider the page number only, rather than the entire address. If we have a reference to a page p, then any immediately following references to page p will never cause a page fault. An example: 0100, 0432,0101,0612, 0102,0103,0104,0611 ? 1,4,1,6,1,6 Page Replacement: Basic Scheme Graph of Page Faults Versus The Number of Frames Memory references: 20 times 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Replacement: FIFO FIFO Page Replacement To associate with each page the time when that page was brought into memory To replace the oldest page if necessary Implementation A FIFO queue to hold all pages in memory. To replace the page the head of queue. To append at the tail when a page is brought into memory. Features Easy to understand and easy to implement Its performance is not always good. Page Replacement: FIFO Page Replacement: FIFO FIFO Illustrating Belady’s Anomaly Memory Conferences : 1,2,3,4,1,2,5,1,2,3,4,5 Page Replacement: OPT An optimal replacement algorithm has the lowest fault rate of all algorithms, and will never suffer from Belady’s anomaly. The optimal replacement algorithm Replace the page that will not be used for the longest period of time. 替换最晚才用的页。 Features Lowest page fault rate (No Belady’s anomaly) Difficult to implement. Can be used for comparison. Page Replacement: OPT Page Replacement: LRU FIFO, OPT, LRU FIFO, looking at the past OPT, looking at the future LRU, looking at the past, predicting the future. LRU: least-recently used To associate with each page the time that page’s last use To replace the page that has not been used for the longest period of time. Page Replacement: LRU Page Replacement: LRU How to implement the LRU Counters Add to the CPU a logical clock or counter Associate with each entry a TimeOfUse field Whenever a reference to page is the made, the