Introduction - If you have any usage issues, please Google them yourself
The simplest paging replacement algorithm is the first in first out algorithm. Each time a new page needs to be transferred in, it will select the page swapping out with the longest time in memory. There are two ways to achieve this: the first is to record the time when each page is called into the page box. When each page needs to be changed out, the earliest page will be found, that is, the longest page in main memory. Another way is to use FIFO queue to achieve, when the page replacement, the front-end of the queue page out, and then put the page to be transferred to the end of the queue.