1. FIFO
The most simple page replacement algorithm is first in first out (FIFO) method. The essence of this algorithm, always choose the longest stay in memory (i.e. the oldest) page replacement, first into the memory page, first out of memory. The reason is: transferred to the memory of the first page, the possibility of no longer being used into memory than just the possibility of large. Create a FIFO queue that holds all the pages in memory. The replacement page is always on the queue header