Re: Linux VM design

Jonathan Morton
2001-09-24T18:56:44Z

> > DP> The arguments in support of aging over LRU that I'm aware of are:
>>
>> DP> - incrementing an age is more efficient than resetting several LRU
>> DP> list links
>> DP> - also captures some frequency-of-use information
>>
>> Of what use this info can be? If one page is accessed 100 times/second
>> and other one once in 10 seconds, they both have to stay in RAM.
>> VM should take 'time since last access' into account whan deciding
>> which page to swap out, not how often it was referenced.
>
>You might want to have a look at this:
>
> http://archi.snu.ac.kr/jhkim/seminar/96-004.ps
> (lrfu algorithm)
>
>To tell the truth, I don't really see why the frequency information is all
>that useful either. Rik suggested it's good for streaming IO but we already
>have effective means of dealing with that that don't rely on any frequency
>information.
>
>So the list of reasons why aging is good is looking really short.

It's not really frequency information. If a page is accessed 1000
times during a single schedule cycle, that will count as a single
increment in the age come the time. However, *macro* frequency
information of this type *is* useful in the case where thrashing is
taking place. You want to swap out the page that is accessed only
once every other schedule cycle, before the one accessed every cycle.
This is of course moot if one process is being suspended (as it
probably should), but the criteria for suspension might include this
access information.

--
--------------------------------------------------------------
from: Jonathan "Chromatix" Morton
mail: chromi@cyberspace.org (not for attachments)
website: http://www.chromatix.uklinux.net/vnc/
geekcode: GCS$/E dpu(!) s:- a20 C+++ UL++ P L+++ E W+ N- o? K? w--- O-- M++$
V? PS PE- Y+ PGP++ t- 5- X- R !tv b++ DI+++ D G e+ h+ r++ y+(*)
tagline: The key to knowledge is not to rely on people to teach you it.