Search code examples
operating-systempage-replacement

How does FIFO page replacement work?

I'm trying to understand the FIFO page replacement algorithm, but all the information I can find amounts to what's below. Can you explain how you use a reference string to evaluate a page replacement algorithm, using the particular example of FIFO?

When a page must be replaced, the oldest page is chosen.

In all our examples, the reference string is

1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5

3 frame (9 page faults) 4 frame (10 page faults)

Solution

  • page replaced when not availbe in Queue.

    go to this link FIFO

    here explained all Page repalacemnt algo. very well with example. you understand easily.