$0.25 The Second Chance Page Replacement Algorithm
- This tutorial was purchased 1 time and rated A+ by students like you.
- Posted on Nov. 27, 2007 at 09:30:56AM
A:
Preview: ... urs at time 20. The oldest page is A, which arrived at time 0, when the process started. If A has the R bit cleared, it is evicted from memory, either by being written to the disk (if it is dirty), or just abandoned (if it is dean). On the other hand, if the R bit is set, A is put onto the end of the list and its “load time” is reset to the current t ...
The full tutorial is about 344 words long .
