Best permutation algorithm
This is an ideal replacement algorithm. The idea is to determine in advance how many instructions the page needs before it can be accessed, and then replace the one with the largest number required for each replacement.
First in first out
The simplest, first in, first out, the page that enters the memory first will also exit first.
Least recently used
Which is LRU
Clock replacement algorithm
Page replacement algorithm-CLOCK replacement algorithm and its improved version_totoro的博客-CSDN博客
Add a use bit for each page, and then set its use position to 1 for each new page, and there is also a pointer, which starts from the first bit by default, and then when the main memory is full, all at the same time When the used bits of are all 1, the bit pointed to by the current pointer, that is, the first position is replaced, and the used positions of all other pages are 0. The pointer moves down.