The working set isn't a page replacement algorithm, but page-replacement algorithms can be designed to only remove pages that aren't in the working set for a particular process.
12.
Requirements for page replacement algorithms have changed due to differences in operating system Solaris ) tends to work at the level of a general purpose kernel memory allocator, rather than at the higher level of a virtual memory subsystem.
13.
A page replacement algorithm looks at the limited information about accesses to the pages provided by hardware, and tries to guess which pages should be replaced to minimize the total number of page misses, while balancing this with the costs ( primary storage and processor time ) of the algorithm itself.
14.
A PTE may also include information about whether the page has been written to ( the " dirty bit " ), when it was last used ( the " accessed bit, " for a least recently used ( LRU ) page replacement algorithm ), what kind of processes ( user mode or supervisor mode ) may read and write it, and whether it should be cached.
