lkml.org 
[lkml]   [2011]   [Jun]   [23]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: [PATCH 6/7] memcg: calc NUMA node's weight for scan.
    On Thu 16-06-11 12:56:33, KAMEZAWA Hiroyuki wrote:
    > From fb8aaa2c5f7fd99dfcb5d2ecb3c1226a58caafea Mon Sep 17 00:00:00 2001
    > From: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
    > Date: Thu, 16 Jun 2011 10:05:46 +0900
    > Subject: [PATCH 6/7] memcg: calc NUMA node's weight for scan.
    >
    > Now, by commit 889976, numa node scan of memcg is in round-robin.
    > As commit log says, "a better algorithm is needed".
    >
    > for implementing some good scheduling, one of required things is
    > defining importance of each node at LRU scanning.
    >
    > This patch defines each node's weight for scan as
    >
    > swappiness = (memcg's swappiness)? memcg's swappiness : 1
    > FILE = inactive_file + (inactive_file_is_low)? active_file : 0
    > ANON = inactive_anon + (inactive_anon_is_low)? active_anon : 0
    >
    > weight = (FILE * (200-swappiness) + ANON * swappiness)/200.

    Shouldn't we consider the node size?
    If we have a node which is almost full with file cache and then other
    node wich is much bigger and it is mostly occupied by anonymous memory
    than the other node might end up with higher weight.

    --
    Michal Hocko
    SUSE Labs
    SUSE LINUX s.r.o.
    Lihovarska 1060/12
    190 00 Praha 9
    Czech Republic


    \
     
     \ /
      Last update: 2011-06-23 15:37    [W:0.021 / U:0.780 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site