FIFO page replacement algorithm memory management technique operating systems

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” [su_highlight background=”#f01818″ color=”#f5fee9″]Read More[/su_highlight], FIFO page replacement algorithm works.

1^st column: First of all, all memory is free.

2^nd column: Page 0 is loaded on memory. Page fault [su_highlight background=”#f01818″ color=”#f5fee9″]Read More[/su_highlight] occurs because page 0 is already not on memory.

3^rd column: Page 7 is loaded on memory. Page fault [su_highlight background=”#f01818″ color=”#f5fee9″]Read More[/su_highlight]  occurs.

4^th column: Page 3 is loaded on memory. Page fault [su_highlight background=”#f01818″ color=”#f5fee9″]Read More[/su_highlight]  occurs.

5^th column: Page 4 is loaded on memory. Page fault occurs.

6^th column: Page 1 is loaded on memory. Page fault occurs.

7th column: Page 7 is loaded on memory. Page fault occurs.

8^th column: Page 3 is loaded on memory. Page fault occurs.

9^th column: Page 8 is loaded on memory. Page fault occurs.

10^th column: Page 5 is loaded on memory. Page fault occurs.

11^th column: Page 0 is loaded on memory. Page fault [su_highlight background=”#f01818″ color=”#f5fee9″]Read More[/su_highlight]  occurs.

MCQs on Page Replacement Algorithm