逻辑地址空间-piazza.ppt

* * * * * * * * * * * * * * * * * * * * 考虑以下序列: A B C A B D A D B C B 最优页替换: 缺页: 5 次 Where will D be brought in? Look for page not referenced farthest in future. What will LRU do? Same decisions as MIN here, but won’t always be true! Example: 最优页替换 C D C B A B C B D A D B A C B A 3 2 1 Ref: Page: 考虑以下序列: A B C D A B C D A B C D LRU (same as FIFO here): Every reference is a page fault! 在该例中最优页替换性能好很多: D LRU 性能可能差？ C B A D C B A D C B A C B A D C B A D C B A D 3 2 1 Ref: Page: B C D C B A C B A D C B A D C B A D 3 2 1 Ref: Page: Adding memory = 降低缺页率? Yes for LRU and MIN Not ne