|
|
| The Second Chance |
|
| Algorithm |
|
|
|
|
|
|
|
|
| ä | It
uses a FIFO replacement strategy. However, |
|||||
| it
will evict the oldest page only if its R bit is |
||||||
| set to
0. |
||||||
| ä | The
algorithm avoids evicting a heavily used |
|||||
| page
that happens to be the oldest in memory. |
||||||
