|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ä |
With
an over-allocated memory there will
|
|
|
|
always
be a need to replace the pages in
|
|
|
|
memory.
|
|
|
ä |
A
page replacement algorithm must choose a
|
|
|
|
page
to replace in such a way that it minimizes
|
|
|
the
page fault rate.
|
|
|
ä |
Page
Replacement Algorithms:
|
|
|
|
ä |
FIFO
|
|
|
|
ä |
Optimal
|
|
|
|
ä |
Not
Recently Used (NRU)
|
|
|
|
ä |
Second
Chance
|
|
|
|
ä |
Least
Recently Used (LRU)
|
|