© Thomas Kunz 2000
SCE 574
242
The FIFO Replacement Algorithm
äWhen a page frame is
needed, we will choose to replace the page that has been the longest in memory.
Reference String:
3 4 5 1
3 4 2
3 4 5
1 2
3
3
4
3
4
5
1
4
5
1
3
5
1
3
4
2
3
4
2
3
4
2
3
4
2
5
4
2
5
1
2
5
1
F F F
F F F
F F F