🚀 go-pugleaf

In article <5967@pt.cs.cmu.edu> ram@wb1.cs.cmu.edu (Rob MacLachlan) writes:

>Many classic VM algorithms (such as Working Set) do consider processes and
>degree of thrashing, etc., but these algorithms seem to be little used in
>recently designed o.s.'es.  [Since this is comp.arch, I will note in passing
>that is may be partly due to brain-dead VM hardware, such as the VAX, which
>doesn't even have a reference bit.]

Instead of examining a reference bit, an OS could check to see if the
page table entry is in the translation cache; this can be better than
a simple reference bit, which only tells you if a page has been read.
If a translation is in the cache, it indicates that the page is likely
being read often.
-Stan