|
|
| 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 |
| 3 |
| 1 |
| 1 |
| 1 |
| 2 |
| 2 |
| 2 |
| 2 |
| 2 |
| 2 |
| 4 |
| 4 |
| 4 |
| 3 |
| 3 |
| 3 |
| 3 |
| 3 |
| 5 |
| 5 |
| 5 |
| 5 |
| 5 |
| 5 |
| 4 |
| 4 |
| 4 |
| 4 |
| 4 |
| 1 |
| 1 |
