PPT Slide
Working Set Paging Algorithm
- Monitor the working set of for each process by computing W (the working set size).
- Change the resident set as W changes.
- If W will not fit in memory, swap out the entire process until it’s working set will fit.
- The WS paging algorithm is a good one, but expensive to implement. Easier to approximate (same as with LRU and LRU approximations).
- Working set algorithm requires a virtual time reference, which is easy to keep track of in the dispatcher at context switch time. We can use the accumulated execution time as the virtual time of the process.