MainPage Back Go2Paperlist

  • ALL >Computer and Education >courses >university courses >undergraduate courses >Operating System >ZSTU class(2019-2020-1) >student directories >2017331200153-梁庆龙

  • homework8

    The simplest page replacement algorithm is the first in, first out (FIFO) method. The essence of this algorithm is to always choose the page replacement with the longest dwell time (i.e. the oldest) in main memory, that is, to enter the page of memory first and exit from memory first.

    1. When the program is running, first load the 7,0,1 three pages into memory.
    2. After that, when the process wants to visit page 2, there will be a page missing interrupt. At this time, according to the first

    全文(Full Article):