[lkml]   [2011]   [May]   [26]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCHv4] memcg: reclaim memory from node in round-robin
On Fri, 6 May 2011 15:13:02 +0900
KAMEZAWA Hiroyuki <> wrote:

> > It would be much better to work out the optimum time at which to rotate
> > the index via some deterministic means.
> >
> > If we can't think of a way of doing that then we should at least pace
> > the rotation frequency via something saner than wall-time. Such as
> > number-of-pages-scanned.
> >
> What I think now is using reclaim_stat or usigng some fairness based on
> the ratio of inactive file caches. We can calculate the total sum of
> recalaim_stat which gives us a scan_ratio for a whole memcg. And we can
> calculate LRU rotate/scan ratio per node. If rotate/scan ratio is small,
> it will be a good candidate of reclaim target. Hmm,
> - check which memory(anon or file) should be scanned.
> (If file is too small, rotate/scan ratio of file is meaningless.)
> - check rotate/scan ratio of each nodes.
> - calculate weights for each nodes (by some logic ?)
> - give a fair scan w.r.t node's weight.
> Hmm, I'll have a study on this.

How's the study coming along ;)

I'll send this in to Linus today, but I'll feel grumpy while doing so.
We really should do something smarter here - the magic constant will
basically always be suboptimal for everyone and we end up tweaking its
value (if we don't, then the feature just wasn't valuable in the first
place) and then we add a tunable and then people try to tweak the
default setting of the tunable and then I deride them for not setting
the tunable in initscripts and then we have to maintain the stupid
tunable after we've changed the internal implementation and it's all
basically screwed up.

How to we automatically determine the optimum time at which to rotate,
at runtime?

 \ /
  Last update: 2011-05-26 21:55    [W:0.108 / U:42.440 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site