Page Replacement Algorithms : FIFO(First In First Out)
1,433 views · Published 22 December 2016 · 8:35 · Indexed 26 October 2026
Channel: HowTo · 2016 · Education
page replacement algorithms decide which memory pages to page out (swap out, write to disk) when a page of memory needs to be allocated. Paging happens when a page fault occurs and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold. The first-in, first-out (FIFO) page replacement algorithm is a low-overhead algorithm that requires little bookkeeping on the part of the operating system. The idea is obvious from the name – the operating system keeps track of all the pages in memory in a queue, with the most recent arrival at the back, and the oldest arrival in front. When a page needs to be replaced, the page at the front of the queue (the oldest page) is selected.
More from this channel
-
1:37
how to create a adhoc network on windows
-
5:57
TCP three way handshaking
-
5:05
How to install Nirgam Simulator for NoC
-
2:02
How to disable a Local area network on windows
-
2:45
How to run simulation with odd even routing on NIRGAM
-
8:10
How to implement a new routing algo in NIRGAM simulator
-
8:53
How to create Blog on Blogger and post an article
-
4:44
How to create Google Forms( doc, xcl, ppt etc)