FIFO page replacement algorithm memory management technique operating systems
FIFO Page replacement is the memory management technique. According to First in First Out page replacement algorithm, the page that will come first to load on the memory will be swapped out first. Similarly, the page that will become last to load on the memory, will be swapped out at the last. According to “demand paging” Read More , FIFO page replacement algorithm works.

1st column: First of all, all memory is free.
2nd column: Page 0 is loaded on memory. Page fault Read More occurs because page 0 is already not on memory.
3rd column: Page 7 is loaded on memory. Page fault Read More occurs.
4th column: Page 3 is loaded on memory. Page fault Read More occurs.
5th column: Page 4 is loaded on memory. Page fault occurs.
6th column: Page 1 is loaded on memory. Page fault occurs.
7th column: Page 7 is loaded on memory. Page fault occurs.
8th column: Page 3 is loaded on memory. Page fault occurs.
9th column: Page 8 is loaded on memory. Page fault occurs.
10th column: Page 5 is loaded on memory. Page fault occurs.
11th column: Page 0 is loaded on memory. Page fault Read More occurs.