diff options
| author | KAMEZAWA Hiroyuki <[email protected]> | 2009-04-02 16:57:33 -0700 |
|---|---|---|
| committer | Linus Torvalds <[email protected]> | 2009-04-02 19:04:55 -0700 |
| commit | 04046e1a0a34286382e913f8fc461440c21d88e8 (patch) | |
| tree | cab2b8a61e7474d509fbd3ea02e38b7c4137ce4b /tools/perf/scripts/python | |
| parent | b4046f00ee7c1e5615261b496cf7309683275b29 (diff) | |
memcg: use CSS ID
Assigning CSS ID for each memcg and use css_get_next() for scanning hierarchy.
Assume folloing tree.
group_A (ID=3)
/01 (ID=4)
/0A (ID=7)
/02 (ID=10)
group_B (ID=5)
and task in group_A/01/0A hits limit at group_A.
reclaim will be done in following order (round-robin).
group_A(3) -> group_A/01 (4) -> group_A/01/0A (7) -> group_A/02(10)
-> group_A -> .....
Round robin by ID. The last visited cgroup is recorded and restart
from it when it start reclaim again.
(More smart algorithm can be implemented..)
No cgroup_mutex or hierarchy_mutex is required.
Signed-off-by: KAMEZAWA Hiroyuki <[email protected]>
Cc: Paul Menage <[email protected]>
Cc: Li Zefan <[email protected]>
Cc: Balbir Singh <[email protected]>
Cc: Daisuke Nishimura <[email protected]>
Cc: David Rientjes <[email protected]>
Signed-off-by: Andrew Morton <[email protected]>
Signed-off-by: Linus Torvalds <[email protected]>
Diffstat (limited to 'tools/perf/scripts/python')
0 files changed, 0 insertions, 0 deletions