lkml.org 
[lkml]   [2005]   [Sep]   [20]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [Question] How to understand Clock-Pro algorithm?
From
Date
On Mon, 2005-09-19 at 23:02, liyu wrote:

>
> Let's assume Mn is the total number of non-resident pages in follow
> words.
>
> Nod, 'M=Mh+Mc' and 'Mc+Mn' < 2M are always true.
>
> Have this implied that Mn is alway less than M? I think so.
Yes.

>
> but if "Once the number exceeds M the memory size in number of pages,
> we terminted the test period of the cold page pointed to by HAND-test."
>
> If Mn is alway less than M, when we move to HAND-test?

The algorithm tries to ensure that Mn <= M holds.
Once Mn == M+1 is detected, run HAND-test to bring it
back to Mn == M. That is, only during the transition period,
Mn <= M might not hold, and we make a correction quickly.

So there is no contradiction here.
Song

>


-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-09-20 12:03    [W:0.035 / U:0.040 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site