Xref: utzoo comp.arch:11140 comp.sys.mips:120
Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!csd4.csd.uwm.edu!bionet!apple!bbn!bbn.com!slackey
From: slackey@bbn.com (Stan Lackey)
Newsgroups: comp.arch,comp.sys.mips
Subject: Re: Memory utilization & inter-process contention
Message-ID: <44795@bbn.COM>
Date: 25 Aug 89 14:20:25 GMT
References: <3332@blake.acs.washington.edu> <2394@unisoft.UUCP> <3357@blake.acs.washington.edu> <5967@pt.cs.cmu.edu>
Sender: news@bbn.COM
Reply-To: slackey@BBN.COM (Stan Lackey)
Organization: Bolt Beranek and Newman Inc., Cambridge MA
Lines: 14

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