Page Replacement Algorithm FIFO, LRU, OPT

Source: Internet
Author: User



Consider the following page:

When the number of memory blocks is three, what are the number of missing pages of the FIFO, LRU, and OPT replacement algorithms?
A: page missing is defined as that all memory blocks are empty at first, so the pages used for the first time generate a page missing.

The number of page breaks is 16.


The number of page breaks is 15.


The number of page breaks is 11.
In the OPT algorithm, pages accessed in the farthest future are swapped out first. When page 6 is to be transferred, the memory status is 1, 2, and 5. The pages to be transferred after page 6 are 2, 1, 2 ,..., It can be seen that 5 is the least used in the recent period of time. In this case, replace page 6 with the memory.




Reprinted Please note: http://blog.csdn.net/speedme

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.