lkml.org 
[lkml]   [2005]   [Sep]   [19]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
Subject[Question] How to understand Clock-Pro algorithm?
Hi, every in LKML/linux-mm:

I have been read CLOCK-Pro paper since last week, and am going to
write one python demo.

After just read , I think I can understand it, however once I begin
implement it, I
found there are many point that not clear.

First, two important parameters Mc, Mh,

In that paper, it assume total memory size is M. (in number of page)

There is a formula:

M = Mc+Mh.

Mc, number of cold pages in memory,
Mh, number of hot pages in memory.

So, in clock list, we can keep track 2M page metadatas at most, we
may include M
non-resident pages.

In '4.3 operationes on searching vicim pages' , the authors said

"we keep track of the number of non-resident cold pages, 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."

My question is out:As this paper words, the number of cold page is
total of resident cold pages
and non-resident pages. It's the seem number of non-resident cold pages
can not beyond M at all!

I also have more questions on CLOCK-Pro. but this question is most
doublt for me.

Any clear word is welcome. thank in advanced.

I suppose experience is more important than theory in
page-replacement field, is it right?



liyu








-
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:06    [W:0.032 / U:0.928 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site