OSDev.org

Hello;

We are trying to implement the Page Replace Algorithm WSClock, but we have some questions.
We know, that we must update our working at every pagefault and every process has its own working set.

We implemented a circular linked list and every entry has a field of "last time of use". At every pagefault we look at every page in the working set and look at the R - Bit and maybe the M - Bit.

The question is, when we must replace a page from the working set, every page fault or if we wanna swap out and another question is, is the size of the working set every time the same?

Thanks

Take a look at these documents, they might be helpful:
https://cs.nyu.edu/courses/spring02/V22 ... clock.html
https://cs.nyu.edu/~gottlieb/courses/20 ... re-10.html