Re: [RFC][PATCH -mm 0/3] mm,vmscan: reclaim from highest score cgroup

[Ying Han <yinghan@google.com>]

On Wed, Aug 8, 2012 at 2:45 PM, Rik van Riel <riel@redhat.com> wrote:
> Instead of doing round robin reclaim over all the cgroups in a zone, we
> reclaim from the highest score cgroup first.
>
> Factors in the scoring are the use ratio of pages in the lruvec
> (recent_rotated / recent_scanned), the size of the lru, the recent amount
> of pressure applied to each lru, whether the cgroup is over its soft limit
> and whether the cgroup has lots of inactive file pages.
>
> This patch series is on top of a recent mmotm with Ying's memcg softreclaim
> patches [2/2] applied.  Unfortunately it turns out that that mmmotm tree
> with Ying's patches does not compile with CONFIG_MEMCG=y, so I am testing
> these patches over the wall untested, as inspiration for others (hi Ying).
>
> This still suffers from the same scalability issue the current code has,
> namely a round robin iteration over all the lruvecs in a zone. We may want
> to fix that in the future by sorting the memcgs/lruvecs in some sort of
> tree, allowing us to find the high priority ones more easily and doing the
> recalculation asynchronously and less often.

Thank you Rik for the work !

I haven't got chance to look through it but I will tomorrow :)

--Ying

--
To unsubscribe, send a message with 'unsubscribe linux-mm' in
the body to majordomo@kvack.org.  For more info on Linux MM,
see: http://www.linux-mm.org/ .
Don't email: <a href=mailto:"dont@kvack.org"> email@kvack.org </a>