2008-03-05 06:28:39 +08:00
|
|
|
Memory Resource Controller
|
|
|
|
|
2014-12-11 07:44:52 +08:00
|
|
|
NOTE: This document is hopelessly outdated and it asks for a complete
|
|
|
|
rewrite. It still contains a useful information so we are keeping it
|
|
|
|
here but make sure to check the current code if you need a deeper
|
|
|
|
understanding.
|
|
|
|
|
2011-06-16 04:00:47 +08:00
|
|
|
NOTE: The Memory Resource Controller has generically been referred to as the
|
|
|
|
memory controller in this document. Do not confuse memory controller
|
|
|
|
used here with the memory controller that is used in hardware.
|
2008-02-07 16:13:46 +08:00
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
(For editors)
|
|
|
|
In this document:
|
|
|
|
When we mention a cgroup (cgroupfs's directory) with memory controller,
|
|
|
|
we call it "memory cgroup". When you see git-log and source code, you'll
|
|
|
|
see patch's title and function names tend to use "memcg".
|
|
|
|
In this document, we avoid using it.
|
2008-02-07 16:13:46 +08:00
|
|
|
|
|
|
|
Benefits and Purpose of the memory controller
|
|
|
|
|
|
|
|
The memory controller isolates the memory behaviour of a group of tasks
|
|
|
|
from the rest of the system. The article on LWN [12] mentions some probable
|
|
|
|
uses of the memory controller. The memory controller can be used to
|
|
|
|
|
|
|
|
a. Isolate an application or a group of applications
|
2012-10-09 07:33:09 +08:00
|
|
|
Memory-hungry applications can be isolated and limited to a smaller
|
2008-02-07 16:13:46 +08:00
|
|
|
amount of memory.
|
2012-10-09 07:33:09 +08:00
|
|
|
b. Create a cgroup with a limited amount of memory; this can be used
|
2008-02-07 16:13:46 +08:00
|
|
|
as a good alternative to booting with mem=XXXX.
|
|
|
|
c. Virtualization solutions can control the amount of memory they want
|
|
|
|
to assign to a virtual machine instance.
|
|
|
|
d. A CD/DVD burner could control the amount of memory used by the
|
|
|
|
rest of the system to ensure that burning does not fail due to lack
|
|
|
|
of available memory.
|
2012-10-09 07:33:09 +08:00
|
|
|
e. There are several other use cases; find one or use the controller just
|
2008-02-07 16:13:46 +08:00
|
|
|
for fun (to learn and hack on the VM subsystem).
|
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
Current Status: linux-2.6.34-mmotm(development version of 2010/April)
|
|
|
|
|
|
|
|
Features:
|
|
|
|
- accounting anonymous pages, file caches, swap caches usage and limiting them.
|
2012-04-13 03:49:10 +08:00
|
|
|
- pages are linked to per-memcg LRU exclusively, and there is no global LRU.
|
2010-05-27 05:42:40 +08:00
|
|
|
- optionally, memory+swap usage can be accounted and limited.
|
|
|
|
- hierarchical accounting
|
|
|
|
- soft limit
|
2012-10-09 07:33:09 +08:00
|
|
|
- moving (recharging) account at moving a task is selectable.
|
2010-05-27 05:42:40 +08:00
|
|
|
- usage threshold notifier
|
memcg: add memory.pressure_level events
With this patch userland applications that want to maintain the
interactivity/memory allocation cost can use the pressure level
notifications. The levels are defined like this:
The "low" level means that the system is reclaiming memory for new
allocations. Monitoring this reclaiming activity might be useful for
maintaining cache level. Upon notification, the program (typically
"Activity Manager") might analyze vmstat and act in advance (i.e.
prematurely shutdown unimportant services).
The "medium" level means that the system is experiencing medium memory
pressure, the system might be making swap, paging out active file
caches, etc. Upon this event applications may decide to further analyze
vmstat/zoneinfo/memcg or internal memory usage statistics and free any
resources that can be easily reconstructed or re-read from a disk.
The "critical" level means that the system is actively thrashing, it is
about to out of memory (OOM) or even the in-kernel OOM killer is on its
way to trigger. Applications should do whatever they can to help the
system. It might be too late to consult with vmstat or any other
statistics, so it's advisable to take an immediate action.
The events are propagated upward until the event is handled, i.e. the
events are not pass-through. Here is what this means: for example you
have three cgroups: A->B->C. Now you set up an event listener on
cgroups A, B and C, and suppose group C experiences some pressure. In
this situation, only group C will receive the notification, i.e. groups
A and B will not receive it. This is done to avoid excessive
"broadcasting" of messages, which disturbs the system and which is
especially bad if we are low on memory or thrashing. So, organize the
cgroups wisely, or propagate the events manually (or, ask us to
implement the pass-through events, explaining why would you need them.)
Performance wise, the memory pressure notifications feature itself is
lightweight and does not require much of bookkeeping, in contrast to the
rest of memcg features. Unfortunately, as of current memcg
implementation, pages accounting is an inseparable part and cannot be
turned off. The good news is that there are some efforts[1] to improve
the situation; plus, implementing the same, fully API-compatible[2]
interface for CONFIG_MEMCG=n case (e.g. embedded) is also a viable
option, so it will not require any changes on the userland side.
[1] http://permalink.gmane.org/gmane.linux.kernel.cgroups/6291
[2] http://lkml.org/lkml/2013/2/21/454
[akpm@linux-foundation.org: coding-style fixes]
[akpm@linux-foundation.org: fix CONFIG_CGROPUPS=n warnings]
Signed-off-by: Anton Vorontsov <anton.vorontsov@linaro.org>
Acked-by: Kirill A. Shutemov <kirill@shutemov.name>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Tejun Heo <tj@kernel.org>
Cc: David Rientjes <rientjes@google.com>
Cc: Pekka Enberg <penberg@kernel.org>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Glauber Costa <glommer@parallels.com>
Cc: Michal Hocko <mhocko@suse.cz>
Cc: Luiz Capitulino <lcapitulino@redhat.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Leonid Moiseichuk <leonid.moiseichuk@nokia.com>
Cc: KOSAKI Motohiro <kosaki.motohiro@gmail.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Bartlomiej Zolnierkiewicz <b.zolnierkie@samsung.com>
Cc: John Stultz <john.stultz@linaro.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-04-30 06:08:31 +08:00
|
|
|
- memory pressure notifier
|
2010-05-27 05:42:40 +08:00
|
|
|
- oom-killer disable knob and oom-notifier
|
|
|
|
- Root cgroup has no limit controls.
|
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
Kernel memory support is a work in progress, and the current version provides
|
2011-12-22 09:02:27 +08:00
|
|
|
basically functionality. (See Section 2.7)
|
2010-05-27 05:42:40 +08:00
|
|
|
|
|
|
|
Brief summary of control files.
|
|
|
|
|
|
|
|
tasks # attach a task(thread) and show list of threads
|
|
|
|
cgroup.procs # show list of processes
|
|
|
|
cgroup.event_control # an interface for event_fd()
|
mm: memcontrol: lockless page counters
Memory is internally accounted in bytes, using spinlock-protected 64-bit
counters, even though the smallest accounting delta is a page. The
counter interface is also convoluted and does too many things.
Introduce a new lockless word-sized page counter API, then change all
memory accounting over to it. The translation from and to bytes then only
happens when interfacing with userspace.
The removed locking overhead is noticable when scaling beyond the per-cpu
charge caches - on a 4-socket machine with 144-threads, the following test
shows the performance differences of 288 memcgs concurrently running a
page fault benchmark:
vanilla:
18631648.500498 task-clock (msec) # 140.643 CPUs utilized ( +- 0.33% )
1,380,638 context-switches # 0.074 K/sec ( +- 0.75% )
24,390 cpu-migrations # 0.001 K/sec ( +- 8.44% )
1,843,305,768 page-faults # 0.099 M/sec ( +- 0.00% )
50,134,994,088,218 cycles # 2.691 GHz ( +- 0.33% )
<not supported> stalled-cycles-frontend
<not supported> stalled-cycles-backend
8,049,712,224,651 instructions # 0.16 insns per cycle ( +- 0.04% )
1,586,970,584,979 branches # 85.176 M/sec ( +- 0.05% )
1,724,989,949 branch-misses # 0.11% of all branches ( +- 0.48% )
132.474343877 seconds time elapsed ( +- 0.21% )
lockless:
12195979.037525 task-clock (msec) # 133.480 CPUs utilized ( +- 0.18% )
832,850 context-switches # 0.068 K/sec ( +- 0.54% )
15,624 cpu-migrations # 0.001 K/sec ( +- 10.17% )
1,843,304,774 page-faults # 0.151 M/sec ( +- 0.00% )
32,811,216,801,141 cycles # 2.690 GHz ( +- 0.18% )
<not supported> stalled-cycles-frontend
<not supported> stalled-cycles-backend
9,999,265,091,727 instructions # 0.30 insns per cycle ( +- 0.10% )
2,076,759,325,203 branches # 170.282 M/sec ( +- 0.12% )
1,656,917,214 branch-misses # 0.08% of all branches ( +- 0.55% )
91.369330729 seconds time elapsed ( +- 0.45% )
On top of improved scalability, this also gets rid of the icky long long
types in the very heart of memcg, which is great for 32 bit and also makes
the code a lot more readable.
Notable differences between the old and new API:
- res_counter_charge() and res_counter_charge_nofail() become
page_counter_try_charge() and page_counter_charge() resp. to match
the more common kernel naming scheme of try_do()/do()
- res_counter_uncharge_until() is only ever used to cancel a local
counter and never to uncharge bigger segments of a hierarchy, so
it's replaced by the simpler page_counter_cancel()
- res_counter_set_limit() is replaced by page_counter_limit(), which
expects its callers to serialize against themselves
- res_counter_memparse_write_strategy() is replaced by
page_counter_limit(), which rounds down to the nearest page size -
rather than up. This is more reasonable for explicitely requested
hard upper limits.
- to keep charging light-weight, page_counter_try_charge() charges
speculatively, only to roll back if the result exceeds the limit.
Because of this, a failing bigger charge can temporarily lock out
smaller charges that would otherwise succeed. The error is bounded
to the difference between the smallest and the biggest possible
charge size, so for memcg, this means that a failing THP charge can
send base page charges into reclaim upto 2MB (4MB) before the limit
would have been reached. This should be acceptable.
[akpm@linux-foundation.org: add includes for WARN_ON_ONCE and memparse]
[akpm@linux-foundation.org: add includes for WARN_ON_ONCE, memparse, strncmp, and PAGE_SIZE]
Signed-off-by: Johannes Weiner <hannes@cmpxchg.org>
Acked-by: Michal Hocko <mhocko@suse.cz>
Acked-by: Vladimir Davydov <vdavydov@parallels.com>
Cc: Tejun Heo <tj@kernel.org>
Cc: David Rientjes <rientjes@google.com>
Cc: Stephen Rothwell <sfr@canb.auug.org.au>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-12-11 07:42:31 +08:00
|
|
|
memory.usage_in_bytes # show current usage for memory
|
2011-04-28 06:26:48 +08:00
|
|
|
(See 5.5 for details)
|
mm: memcontrol: lockless page counters
Memory is internally accounted in bytes, using spinlock-protected 64-bit
counters, even though the smallest accounting delta is a page. The
counter interface is also convoluted and does too many things.
Introduce a new lockless word-sized page counter API, then change all
memory accounting over to it. The translation from and to bytes then only
happens when interfacing with userspace.
The removed locking overhead is noticable when scaling beyond the per-cpu
charge caches - on a 4-socket machine with 144-threads, the following test
shows the performance differences of 288 memcgs concurrently running a
page fault benchmark:
vanilla:
18631648.500498 task-clock (msec) # 140.643 CPUs utilized ( +- 0.33% )
1,380,638 context-switches # 0.074 K/sec ( +- 0.75% )
24,390 cpu-migrations # 0.001 K/sec ( +- 8.44% )
1,843,305,768 page-faults # 0.099 M/sec ( +- 0.00% )
50,134,994,088,218 cycles # 2.691 GHz ( +- 0.33% )
<not supported> stalled-cycles-frontend
<not supported> stalled-cycles-backend
8,049,712,224,651 instructions # 0.16 insns per cycle ( +- 0.04% )
1,586,970,584,979 branches # 85.176 M/sec ( +- 0.05% )
1,724,989,949 branch-misses # 0.11% of all branches ( +- 0.48% )
132.474343877 seconds time elapsed ( +- 0.21% )
lockless:
12195979.037525 task-clock (msec) # 133.480 CPUs utilized ( +- 0.18% )
832,850 context-switches # 0.068 K/sec ( +- 0.54% )
15,624 cpu-migrations # 0.001 K/sec ( +- 10.17% )
1,843,304,774 page-faults # 0.151 M/sec ( +- 0.00% )
32,811,216,801,141 cycles # 2.690 GHz ( +- 0.18% )
<not supported> stalled-cycles-frontend
<not supported> stalled-cycles-backend
9,999,265,091,727 instructions # 0.30 insns per cycle ( +- 0.10% )
2,076,759,325,203 branches # 170.282 M/sec ( +- 0.12% )
1,656,917,214 branch-misses # 0.08% of all branches ( +- 0.55% )
91.369330729 seconds time elapsed ( +- 0.45% )
On top of improved scalability, this also gets rid of the icky long long
types in the very heart of memcg, which is great for 32 bit and also makes
the code a lot more readable.
Notable differences between the old and new API:
- res_counter_charge() and res_counter_charge_nofail() become
page_counter_try_charge() and page_counter_charge() resp. to match
the more common kernel naming scheme of try_do()/do()
- res_counter_uncharge_until() is only ever used to cancel a local
counter and never to uncharge bigger segments of a hierarchy, so
it's replaced by the simpler page_counter_cancel()
- res_counter_set_limit() is replaced by page_counter_limit(), which
expects its callers to serialize against themselves
- res_counter_memparse_write_strategy() is replaced by
page_counter_limit(), which rounds down to the nearest page size -
rather than up. This is more reasonable for explicitely requested
hard upper limits.
- to keep charging light-weight, page_counter_try_charge() charges
speculatively, only to roll back if the result exceeds the limit.
Because of this, a failing bigger charge can temporarily lock out
smaller charges that would otherwise succeed. The error is bounded
to the difference between the smallest and the biggest possible
charge size, so for memcg, this means that a failing THP charge can
send base page charges into reclaim upto 2MB (4MB) before the limit
would have been reached. This should be acceptable.
[akpm@linux-foundation.org: add includes for WARN_ON_ONCE and memparse]
[akpm@linux-foundation.org: add includes for WARN_ON_ONCE, memparse, strncmp, and PAGE_SIZE]
Signed-off-by: Johannes Weiner <hannes@cmpxchg.org>
Acked-by: Michal Hocko <mhocko@suse.cz>
Acked-by: Vladimir Davydov <vdavydov@parallels.com>
Cc: Tejun Heo <tj@kernel.org>
Cc: David Rientjes <rientjes@google.com>
Cc: Stephen Rothwell <sfr@canb.auug.org.au>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-12-11 07:42:31 +08:00
|
|
|
memory.memsw.usage_in_bytes # show current usage for memory+Swap
|
2011-04-28 06:26:48 +08:00
|
|
|
(See 5.5 for details)
|
2010-05-27 05:42:40 +08:00
|
|
|
memory.limit_in_bytes # set/show limit of memory usage
|
|
|
|
memory.memsw.limit_in_bytes # set/show limit of memory+Swap usage
|
|
|
|
memory.failcnt # show the number of memory usage hits limits
|
|
|
|
memory.memsw.failcnt # show the number of memory+Swap hits limits
|
|
|
|
memory.max_usage_in_bytes # show max memory usage recorded
|
2012-01-13 09:18:24 +08:00
|
|
|
memory.memsw.max_usage_in_bytes # show max memory+Swap usage recorded
|
2010-05-27 05:42:40 +08:00
|
|
|
memory.soft_limit_in_bytes # set/show soft limit of memory usage
|
|
|
|
memory.stat # show various statistics
|
|
|
|
memory.use_hierarchy # set/show hierarchical account enabled
|
|
|
|
memory.force_empty # trigger forced move charge to parent
|
memcg: add memory.pressure_level events
With this patch userland applications that want to maintain the
interactivity/memory allocation cost can use the pressure level
notifications. The levels are defined like this:
The "low" level means that the system is reclaiming memory for new
allocations. Monitoring this reclaiming activity might be useful for
maintaining cache level. Upon notification, the program (typically
"Activity Manager") might analyze vmstat and act in advance (i.e.
prematurely shutdown unimportant services).
The "medium" level means that the system is experiencing medium memory
pressure, the system might be making swap, paging out active file
caches, etc. Upon this event applications may decide to further analyze
vmstat/zoneinfo/memcg or internal memory usage statistics and free any
resources that can be easily reconstructed or re-read from a disk.
The "critical" level means that the system is actively thrashing, it is
about to out of memory (OOM) or even the in-kernel OOM killer is on its
way to trigger. Applications should do whatever they can to help the
system. It might be too late to consult with vmstat or any other
statistics, so it's advisable to take an immediate action.
The events are propagated upward until the event is handled, i.e. the
events are not pass-through. Here is what this means: for example you
have three cgroups: A->B->C. Now you set up an event listener on
cgroups A, B and C, and suppose group C experiences some pressure. In
this situation, only group C will receive the notification, i.e. groups
A and B will not receive it. This is done to avoid excessive
"broadcasting" of messages, which disturbs the system and which is
especially bad if we are low on memory or thrashing. So, organize the
cgroups wisely, or propagate the events manually (or, ask us to
implement the pass-through events, explaining why would you need them.)
Performance wise, the memory pressure notifications feature itself is
lightweight and does not require much of bookkeeping, in contrast to the
rest of memcg features. Unfortunately, as of current memcg
implementation, pages accounting is an inseparable part and cannot be
turned off. The good news is that there are some efforts[1] to improve
the situation; plus, implementing the same, fully API-compatible[2]
interface for CONFIG_MEMCG=n case (e.g. embedded) is also a viable
option, so it will not require any changes on the userland side.
[1] http://permalink.gmane.org/gmane.linux.kernel.cgroups/6291
[2] http://lkml.org/lkml/2013/2/21/454
[akpm@linux-foundation.org: coding-style fixes]
[akpm@linux-foundation.org: fix CONFIG_CGROPUPS=n warnings]
Signed-off-by: Anton Vorontsov <anton.vorontsov@linaro.org>
Acked-by: Kirill A. Shutemov <kirill@shutemov.name>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Tejun Heo <tj@kernel.org>
Cc: David Rientjes <rientjes@google.com>
Cc: Pekka Enberg <penberg@kernel.org>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Glauber Costa <glommer@parallels.com>
Cc: Michal Hocko <mhocko@suse.cz>
Cc: Luiz Capitulino <lcapitulino@redhat.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Leonid Moiseichuk <leonid.moiseichuk@nokia.com>
Cc: KOSAKI Motohiro <kosaki.motohiro@gmail.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Bartlomiej Zolnierkiewicz <b.zolnierkie@samsung.com>
Cc: John Stultz <john.stultz@linaro.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-04-30 06:08:31 +08:00
|
|
|
memory.pressure_level # set memory pressure notifications
|
2010-05-27 05:42:40 +08:00
|
|
|
memory.swappiness # set/show swappiness parameter of vmscan
|
|
|
|
(See sysctl's vm.swappiness)
|
|
|
|
memory.move_charge_at_immigrate # set/show controls of moving charges
|
|
|
|
memory.oom_control # set/show oom controls.
|
2011-06-16 06:08:16 +08:00
|
|
|
memory.numa_stat # show the number of memory usage per numa node
|
2010-05-27 05:42:40 +08:00
|
|
|
|
2012-12-19 06:22:22 +08:00
|
|
|
memory.kmem.limit_in_bytes # set/show hard limit for kernel memory
|
|
|
|
memory.kmem.usage_in_bytes # show current kernel memory allocation
|
|
|
|
memory.kmem.failcnt # show the number of kernel memory usage hits limits
|
|
|
|
memory.kmem.max_usage_in_bytes # show max kernel memory usage recorded
|
|
|
|
|
2011-12-12 05:47:06 +08:00
|
|
|
memory.kmem.tcp.limit_in_bytes # set/show hard limit for tcp buf memory
|
2011-12-12 05:47:07 +08:00
|
|
|
memory.kmem.tcp.usage_in_bytes # show current tcp buf memory allocation
|
2012-08-01 07:43:21 +08:00
|
|
|
memory.kmem.tcp.failcnt # show the number of tcp buf memory usage hits limits
|
|
|
|
memory.kmem.tcp.max_usage_in_bytes # show max tcp buf memory usage recorded
|
2011-12-12 05:47:01 +08:00
|
|
|
|
2008-02-07 16:13:46 +08:00
|
|
|
1. History
|
|
|
|
|
|
|
|
The memory controller has a long history. A request for comments for the memory
|
|
|
|
controller was posted by Balbir Singh [1]. At the time the RFC was posted
|
|
|
|
there were several implementations for memory control. The goal of the
|
|
|
|
RFC was to build consensus and agreement for the minimal features required
|
|
|
|
for memory control. The first RSS controller was posted by Balbir Singh[2]
|
|
|
|
in Feb 2007. Pavel Emelianov [3][4][5] has since posted three versions of the
|
|
|
|
RSS controller. At OLS, at the resource management BoF, everyone suggested
|
|
|
|
that we handle both page cache and RSS together. Another request was raised
|
|
|
|
to allow user space handling of OOM. The current memory controller is
|
|
|
|
at version 6; it combines both mapped (RSS) and unmapped Page
|
|
|
|
Cache Control [11].
|
|
|
|
|
|
|
|
2. Memory Control
|
|
|
|
|
|
|
|
Memory is a unique resource in the sense that it is present in a limited
|
|
|
|
amount. If a task requires a lot of CPU processing, the task can spread
|
|
|
|
its processing over a period of hours, days, months or years, but with
|
|
|
|
memory, the same physical memory needs to be reused to accomplish the task.
|
|
|
|
|
|
|
|
The memory controller implementation has been divided into phases. These
|
|
|
|
are:
|
|
|
|
|
|
|
|
1. Memory controller
|
|
|
|
2. mlock(2) controller
|
|
|
|
3. Kernel user memory accounting and slab control
|
|
|
|
4. user mappings length controller
|
|
|
|
|
|
|
|
The memory controller is the first controller developed.
|
|
|
|
|
|
|
|
2.1. Design
|
|
|
|
|
2014-12-11 07:42:37 +08:00
|
|
|
The core of the design is a counter called the page_counter. The
|
|
|
|
page_counter tracks the current memory usage and limit of the group of
|
|
|
|
processes associated with the controller. Each cgroup has a memory controller
|
|
|
|
specific data structure (mem_cgroup) associated with it.
|
2008-02-07 16:13:46 +08:00
|
|
|
|
|
|
|
2.2. Accounting
|
|
|
|
|
|
|
|
+--------------------+
|
2014-12-11 07:42:37 +08:00
|
|
|
| mem_cgroup |
|
|
|
|
| (page_counter) |
|
2008-02-07 16:13:46 +08:00
|
|
|
+--------------------+
|
|
|
|
/ ^ \
|
|
|
|
/ | \
|
|
|
|
+---------------+ | +---------------+
|
|
|
|
| mm_struct | |.... | mm_struct |
|
|
|
|
| | | | |
|
|
|
|
+---------------+ | +---------------+
|
|
|
|
|
|
|
|
|
+ --------------+
|
|
|
|
|
|
|
|
|
+---------------+ +------+--------+
|
|
|
|
| page +----------> page_cgroup|
|
|
|
|
| | | |
|
|
|
|
+---------------+ +---------------+
|
|
|
|
|
|
|
|
(Figure 1: Hierarchy of Accounting)
|
|
|
|
|
|
|
|
|
|
|
|
Figure 1 shows the important aspects of the controller
|
|
|
|
|
|
|
|
1. Accounting happens per cgroup
|
|
|
|
2. Each mm_struct knows about which cgroup it belongs to
|
|
|
|
3. Each page has a pointer to the page_cgroup, which in turn knows the
|
|
|
|
cgroup it belongs to
|
|
|
|
|
2012-12-12 08:01:28 +08:00
|
|
|
The accounting is done as follows: mem_cgroup_charge_common() is invoked to
|
|
|
|
set up the necessary data structures and check if the cgroup that is being
|
|
|
|
charged is over its limit. If it is, then reclaim is invoked on the cgroup.
|
2008-02-07 16:13:46 +08:00
|
|
|
More details can be found in the reclaim section of this document.
|
|
|
|
If everything goes well, a page meta-data-structure called page_cgroup is
|
2010-05-27 05:42:40 +08:00
|
|
|
updated. page_cgroup has its own LRU on cgroup.
|
|
|
|
(*) page_cgroup structure is allocated at boot/memory-hotplug time.
|
2008-02-07 16:13:46 +08:00
|
|
|
|
|
|
|
2.2.1 Accounting details
|
|
|
|
|
2008-10-19 11:28:10 +08:00
|
|
|
All mapped anon pages (RSS) and cache pages (Page Cache) are accounted.
|
2012-04-13 03:49:10 +08:00
|
|
|
Some pages which are never reclaimable and will not be on the LRU
|
2010-05-27 05:42:40 +08:00
|
|
|
are not accounted. We just account pages under usual VM management.
|
2008-10-19 11:28:10 +08:00
|
|
|
|
|
|
|
RSS pages are accounted at page_fault unless they've already been accounted
|
|
|
|
for earlier. A file page will be accounted for as Page Cache when it's
|
|
|
|
inserted into inode (radix-tree). While it's mapped into the page tables of
|
|
|
|
processes, duplicate accounting is carefully avoided.
|
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
An RSS page is unaccounted when it's fully unmapped. A PageCache page is
|
2010-05-27 05:42:40 +08:00
|
|
|
unaccounted when it's removed from radix-tree. Even if RSS pages are fully
|
|
|
|
unmapped (by kswapd), they may exist as SwapCache in the system until they
|
2012-10-09 07:33:09 +08:00
|
|
|
are really freed. Such SwapCaches are also accounted.
|
2010-05-27 05:42:40 +08:00
|
|
|
A swapped-in page is not accounted until it's mapped.
|
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
Note: The kernel does swapin-readahead and reads multiple swaps at once.
|
2010-05-27 05:42:40 +08:00
|
|
|
This means swapped-in pages may contain pages for other tasks than a task
|
|
|
|
causing page fault. So, we avoid accounting at swap-in I/O.
|
2008-10-19 11:28:10 +08:00
|
|
|
|
|
|
|
At page migration, accounting information is kept.
|
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
Note: we just account pages-on-LRU because our purpose is to control amount
|
|
|
|
of used pages; not-on-LRU pages tend to be out-of-control from VM view.
|
2008-02-07 16:13:46 +08:00
|
|
|
|
|
|
|
2.3 Shared Page Accounting
|
|
|
|
|
|
|
|
Shared pages are accounted on the basis of the first touch approach. The
|
|
|
|
cgroup that first touches a page is accounted for the page. The principle
|
|
|
|
behind this approach is that a cgroup that aggressively uses a shared
|
|
|
|
page will eventually get charged for it (once it is uncharged from
|
|
|
|
the cgroup that brought it in -- this will happen on memory pressure).
|
|
|
|
|
memcg: fix/change behavior of shared anon at moving task
This patch changes memcg's behavior at task_move().
At task_move(), the kernel scans a task's page table and move the changes
for mapped pages from source cgroup to target cgroup. There has been a
bug at handling shared anonymous pages for a long time.
Before patch:
- The spec says 'shared anonymous pages are not moved.'
- The implementation was 'shared anonymoys pages may be moved'.
If page_mapcount <=2, shared anonymous pages's charge were moved.
After patch:
- The spec says 'all anonymous pages are moved'.
- The implementation is 'all anonymous pages are moved'.
Considering usage of memcg, this will not affect user's experience.
'shared anonymous' pages only exists between a tree of processes which
don't do exec(). Moving one of process without exec() seems not sane.
For example, libcgroup will not be affected by this change. (Anyway, no
one noticed the implementation for a long time...)
Below is a discussion log:
- current spec/implementation are complex
- Now, shared file caches are moved
- It adds unclear check as page_mapcount(). To do correct check,
we should check swap users, etc.
- No one notice this implementation behavior. So, no one get benefit
from the design.
- In general, once task is moved to a cgroup for running, it will not
be moved....
- Finally, we have control knob as memory.move_charge_at_immigrate.
Here is a patch to allow moving shared pages, completely. This makes
memcg simpler and fix current broken code.
Suggested-by: Hugh Dickins <hughd@google.com>
Signed-off-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Acked-by: Michal Hocko <mhocko@suse.cz>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Naoya Horiguchi <n-horiguchi@ah.jp.nec.com>
Cc: Glauber Costa <glommer@parallels.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2012-05-30 06:06:51 +08:00
|
|
|
But see section 8.2: when moving a task to another cgroup, its pages may
|
|
|
|
be recharged to the new cgroup, if move_charge_at_immigrate has been chosen.
|
|
|
|
|
2013-03-26 06:59:16 +08:00
|
|
|
Exception: If CONFIG_MEMCG_SWAP is not used.
|
2009-01-08 10:08:00 +08:00
|
|
|
When you do swapoff and make swapped-out pages of shmem(tmpfs) to
|
2009-01-08 10:07:56 +08:00
|
|
|
be backed into memory in force, charges for pages are accounted against the
|
|
|
|
caller of swapoff rather than the users of shmem.
|
|
|
|
|
2012-08-01 07:43:02 +08:00
|
|
|
2.4 Swap Extension (CONFIG_MEMCG_SWAP)
|
2010-05-27 05:42:40 +08:00
|
|
|
|
2009-01-08 10:08:00 +08:00
|
|
|
Swap Extension allows you to record charge for swap. A swapped-in page is
|
|
|
|
charged back to original page allocator if possible.
|
|
|
|
|
|
|
|
When swap is accounted, following files are added.
|
|
|
|
- memory.memsw.usage_in_bytes.
|
|
|
|
- memory.memsw.limit_in_bytes.
|
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
memsw means memory+swap. Usage of memory+swap is limited by
|
|
|
|
memsw.limit_in_bytes.
|
|
|
|
|
|
|
|
Example: Assume a system with 4G of swap. A task which allocates 6G of memory
|
|
|
|
(by mistake) under 2G memory limitation will use all swap.
|
|
|
|
In this case, setting memsw.limit_in_bytes=3G will prevent bad use of swap.
|
2012-10-09 07:33:09 +08:00
|
|
|
By using the memsw limit, you can avoid system OOM which can be caused by swap
|
2010-05-27 05:42:40 +08:00
|
|
|
shortage.
|
2009-01-08 10:08:00 +08:00
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
* why 'memory+swap' rather than swap.
|
2009-01-08 10:08:00 +08:00
|
|
|
The global LRU(kswapd) can swap out arbitrary pages. Swap-out means
|
|
|
|
to move account from memory to swap...there is no change in usage of
|
2010-05-27 05:42:40 +08:00
|
|
|
memory+swap. In other words, when we want to limit the usage of swap without
|
|
|
|
affecting global LRU, memory+swap limit is better than just limiting swap from
|
2012-10-09 07:33:09 +08:00
|
|
|
an OS point of view.
|
2009-06-18 07:27:19 +08:00
|
|
|
|
|
|
|
* What happens when a cgroup hits memory.memsw.limit_in_bytes
|
2011-06-16 04:00:47 +08:00
|
|
|
When a cgroup hits memory.memsw.limit_in_bytes, it's useless to do swap-out
|
2009-06-18 07:27:19 +08:00
|
|
|
in this cgroup. Then, swap-out will not be done by cgroup routine and file
|
|
|
|
caches are dropped. But as mentioned above, global LRU can do swapout memory
|
|
|
|
from it for sanity of the system's memory management state. You can't forbid
|
|
|
|
it by cgroup.
|
2009-01-08 10:08:00 +08:00
|
|
|
|
|
|
|
2.5 Reclaim
|
2008-02-07 16:13:46 +08:00
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
Each cgroup maintains a per cgroup LRU which has the same structure as
|
|
|
|
global VM. When a cgroup goes over its limit, we first try
|
2008-02-07 16:13:46 +08:00
|
|
|
to reclaim memory from the cgroup so as to make space for the new
|
|
|
|
pages that the cgroup has touched. If the reclaim is unsuccessful,
|
|
|
|
an OOM routine is invoked to select and kill the bulkiest task in the
|
2010-05-27 05:42:40 +08:00
|
|
|
cgroup. (See 10. OOM Control below.)
|
2008-02-07 16:13:46 +08:00
|
|
|
|
|
|
|
The reclaim algorithm has not been modified for cgroups, except that
|
2012-10-09 07:33:09 +08:00
|
|
|
pages that are selected for reclaiming come from the per-cgroup LRU
|
2008-02-07 16:13:46 +08:00
|
|
|
list.
|
|
|
|
|
2009-09-24 06:56:32 +08:00
|
|
|
NOTE: Reclaim does not work for the root cgroup, since we cannot set any
|
|
|
|
limits on the root cgroup.
|
|
|
|
|
memcg: handle panic_on_oom=always case
Presently, if panic_on_oom=2, the whole system panics even if the oom
happend in some special situation (as cpuset, mempolicy....). Then,
panic_on_oom=2 means painc_on_oom_always.
Now, memcg doesn't check panic_on_oom flag. This patch adds a check.
BTW, how it's useful ?
kdump+panic_on_oom=2 is the last tool to investigate what happens in
oom-ed system. When a task is killed, the sysytem recovers and there will
be few hint to know what happnes. In mission critical system, oom should
never happen. Then, panic_on_oom=2+kdump is useful to avoid next OOM by
knowing precise information via snapshot.
TODO:
- For memcg, it's for isolate system's memory usage, oom-notiifer and
freeze_at_oom (or rest_at_oom) should be implemented. Then, management
daemon can do similar jobs (as kdump) or taking snapshot per cgroup.
Signed-off-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Balbir Singh <balbir@linux.vnet.ibm.com>
Cc: David Rientjes <rientjes@google.com>
Cc: Nick Piggin <npiggin@suse.de>
Reviewed-by: Daisuke Nishimura <nishimura@mxp.nes.nec.co.jp>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2010-03-11 07:22:32 +08:00
|
|
|
Note2: When panic_on_oom is set to "2", the whole system will panic.
|
|
|
|
|
2010-05-27 05:42:36 +08:00
|
|
|
When oom event notifier is registered, event will be delivered.
|
|
|
|
(See oom_control section)
|
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
2.6 Locking
|
2008-02-07 16:13:46 +08:00
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
lock_page_cgroup()/unlock_page_cgroup() should not be called under
|
|
|
|
mapping->tree_lock.
|
2008-02-07 16:13:46 +08:00
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
Other lock order is following:
|
|
|
|
PG_locked.
|
|
|
|
mm->page_table_lock
|
|
|
|
zone->lru_lock
|
|
|
|
lock_page_cgroup.
|
|
|
|
In many cases, just lock_page_cgroup() is called.
|
|
|
|
per-zone-per-cgroup LRU (cgroup's private LRU) is just guarded by
|
|
|
|
zone->lru_lock, it has no lock of its own.
|
2008-02-07 16:13:46 +08:00
|
|
|
|
2012-08-01 07:43:02 +08:00
|
|
|
2.7 Kernel Memory Extension (CONFIG_MEMCG_KMEM)
|
2011-12-12 05:47:01 +08:00
|
|
|
|
|
|
|
With the Kernel memory extension, the Memory Controller is able to limit
|
|
|
|
the amount of kernel memory used by the system. Kernel memory is fundamentally
|
|
|
|
different than user memory, since it can't be swapped out, which makes it
|
|
|
|
possible to DoS the system by consuming too much of this precious resource.
|
|
|
|
|
2012-12-19 06:22:22 +08:00
|
|
|
Kernel memory won't be accounted at all until limit on a group is set. This
|
|
|
|
allows for existing setups to continue working without disruption. The limit
|
|
|
|
cannot be set if the cgroup have children, or if there are already tasks in the
|
|
|
|
cgroup. Attempting to set the limit under those conditions will return -EBUSY.
|
|
|
|
When use_hierarchy == 1 and a group is accounted, its children will
|
|
|
|
automatically be accounted regardless of their limit value.
|
|
|
|
|
|
|
|
After a group is first limited, it will be kept being accounted until it
|
|
|
|
is removed. The memory limitation itself, can of course be removed by writing
|
|
|
|
-1 to memory.kmem.limit_in_bytes. In this case, kmem will be accounted, but not
|
|
|
|
limited.
|
|
|
|
|
2011-12-12 05:47:01 +08:00
|
|
|
Kernel memory limits are not imposed for the root cgroup. Usage for the root
|
2012-12-19 06:22:22 +08:00
|
|
|
cgroup may or may not be accounted. The memory used is accumulated into
|
|
|
|
memory.kmem.usage_in_bytes, or in a separate counter when it makes sense.
|
|
|
|
(currently only for tcp).
|
|
|
|
The main "kmem" counter is fed into the main counter, so kmem charges will
|
|
|
|
also be visible from the user counter.
|
2011-12-12 05:47:01 +08:00
|
|
|
|
|
|
|
Currently no soft limit is implemented for kernel memory. It is future work
|
|
|
|
to trigger slab reclaim when those limits are reached.
|
|
|
|
|
|
|
|
2.7.1 Current Kernel Memory resources accounted
|
|
|
|
|
2012-12-19 06:22:22 +08:00
|
|
|
* stack pages: every process consumes some stack pages. By accounting into
|
|
|
|
kernel memory, we prevent new processes from being created when the kernel
|
|
|
|
memory usage is too high.
|
|
|
|
|
2012-12-19 06:23:08 +08:00
|
|
|
* slab pages: pages allocated by the SLAB or SLUB allocator are tracked. A copy
|
2013-05-09 07:56:16 +08:00
|
|
|
of each kmem_cache is created every time the cache is touched by the first time
|
2012-12-19 06:23:08 +08:00
|
|
|
from inside the memcg. The creation is done lazily, so some objects can still be
|
|
|
|
skipped while the cache is being created. All objects in a slab page should
|
|
|
|
belong to the same memcg. This only fails to hold when a task is migrated to a
|
|
|
|
different memcg during the page allocation by the cache.
|
|
|
|
|
2011-12-12 05:47:03 +08:00
|
|
|
* sockets memory pressure: some sockets protocols have memory pressure
|
|
|
|
thresholds. The Memory Controller allows them to be controlled individually
|
|
|
|
per cgroup, instead of globally.
|
2011-12-12 05:47:01 +08:00
|
|
|
|
2011-12-12 05:47:04 +08:00
|
|
|
* tcp memory pressure: sockets memory pressure for the tcp protocol.
|
|
|
|
|
2014-12-13 08:58:50 +08:00
|
|
|
2.7.2 Common use cases
|
2012-12-19 06:22:22 +08:00
|
|
|
|
|
|
|
Because the "kmem" counter is fed to the main user counter, kernel memory can
|
|
|
|
never be limited completely independently of user memory. Say "U" is the user
|
|
|
|
limit, and "K" the kernel limit. There are three possible ways limits can be
|
|
|
|
set:
|
|
|
|
|
|
|
|
U != 0, K = unlimited:
|
|
|
|
This is the standard memcg limitation mechanism already present before kmem
|
|
|
|
accounting. Kernel memory is completely ignored.
|
|
|
|
|
|
|
|
U != 0, K < U:
|
|
|
|
Kernel memory is a subset of the user memory. This setup is useful in
|
|
|
|
deployments where the total amount of memory per-cgroup is overcommited.
|
|
|
|
Overcommiting kernel memory limits is definitely not recommended, since the
|
|
|
|
box can still run out of non-reclaimable memory.
|
|
|
|
In this case, the admin could set up K so that the sum of all groups is
|
|
|
|
never greater than the total memory, and freely set U at the cost of his
|
|
|
|
QoS.
|
2015-04-01 22:30:36 +08:00
|
|
|
WARNING: In the current implementation, memory reclaim will NOT be
|
|
|
|
triggered for a cgroup when it hits K while staying below U, which makes
|
|
|
|
this setup impractical.
|
2012-12-19 06:22:22 +08:00
|
|
|
|
|
|
|
U != 0, K >= U:
|
|
|
|
Since kmem charges will also be fed to the user counter and reclaim will be
|
|
|
|
triggered for the cgroup for both kinds of memory. This setup gives the
|
|
|
|
admin a unified view of memory, and it is also useful for people who just
|
|
|
|
want to track kernel memory usage.
|
|
|
|
|
2008-02-07 16:13:46 +08:00
|
|
|
3. User Interface
|
|
|
|
|
2014-12-13 08:58:50 +08:00
|
|
|
3.0. Configuration
|
2008-02-07 16:13:46 +08:00
|
|
|
|
|
|
|
a. Enable CONFIG_CGROUPS
|
2014-12-11 07:42:37 +08:00
|
|
|
b. Enable CONFIG_MEMCG
|
|
|
|
c. Enable CONFIG_MEMCG_SWAP (to use swap extension)
|
2012-12-19 06:22:22 +08:00
|
|
|
d. Enable CONFIG_MEMCG_KMEM (to use kmem extension)
|
2008-02-07 16:13:46 +08:00
|
|
|
|
2014-12-13 08:58:50 +08:00
|
|
|
3.1. Prepare the cgroups (see cgroups.txt, Why are cgroups needed?)
|
2011-06-16 03:59:45 +08:00
|
|
|
# mount -t tmpfs none /sys/fs/cgroup
|
|
|
|
# mkdir /sys/fs/cgroup/memory
|
|
|
|
# mount -t cgroup none /sys/fs/cgroup/memory -o memory
|
2008-02-07 16:13:46 +08:00
|
|
|
|
2014-12-13 08:58:50 +08:00
|
|
|
3.2. Make the new group and move bash into it
|
2011-06-16 03:59:45 +08:00
|
|
|
# mkdir /sys/fs/cgroup/memory/0
|
|
|
|
# echo $$ > /sys/fs/cgroup/memory/0/tasks
|
2008-02-07 16:13:46 +08:00
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
Since now we're in the 0 cgroup, we can alter the memory limit:
|
2011-06-16 03:59:45 +08:00
|
|
|
# echo 4M > /sys/fs/cgroup/memory/0/memory.limit_in_bytes
|
2008-02-07 16:13:57 +08:00
|
|
|
|
|
|
|
NOTE: We can use a suffix (k, K, m, M, g or G) to indicate values in kilo,
|
2010-05-27 05:42:40 +08:00
|
|
|
mega or gigabytes. (Here, Kilo, Mega, Giga are Kibibytes, Mebibytes, Gibibytes.)
|
|
|
|
|
2009-06-18 07:27:20 +08:00
|
|
|
NOTE: We can write "-1" to reset the *.limit_in_bytes(unlimited).
|
2009-09-24 06:56:32 +08:00
|
|
|
NOTE: We cannot set limits on the root cgroup any more.
|
2008-02-07 16:13:57 +08:00
|
|
|
|
2011-06-16 03:59:45 +08:00
|
|
|
# cat /sys/fs/cgroup/memory/0/memory.limit_in_bytes
|
2008-02-24 07:24:12 +08:00
|
|
|
4194304
|
2008-02-07 16:13:57 +08:00
|
|
|
|
2008-02-07 16:13:46 +08:00
|
|
|
We can check the usage:
|
2011-06-16 03:59:45 +08:00
|
|
|
# cat /sys/fs/cgroup/memory/0/memory.usage_in_bytes
|
2008-02-24 07:24:12 +08:00
|
|
|
1216512
|
2008-02-07 16:13:57 +08:00
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
A successful write to this file does not guarantee a successful setting of
|
2010-05-27 05:42:40 +08:00
|
|
|
this limit to the value written into the file. This can be due to a
|
2008-02-07 16:13:57 +08:00
|
|
|
number of factors, such as rounding up to page boundaries or the total
|
2010-05-27 05:42:40 +08:00
|
|
|
availability of memory on the system. The user is required to re-read
|
2008-02-07 16:13:57 +08:00
|
|
|
this file after a write to guarantee the value committed by the kernel.
|
|
|
|
|
2008-03-05 06:28:24 +08:00
|
|
|
# echo 1 > memory.limit_in_bytes
|
2008-02-07 16:13:57 +08:00
|
|
|
# cat memory.limit_in_bytes
|
2008-02-24 07:24:12 +08:00
|
|
|
4096
|
2008-02-07 16:13:46 +08:00
|
|
|
|
|
|
|
The memory.failcnt field gives the number of times that the cgroup limit was
|
|
|
|
exceeded.
|
|
|
|
|
2008-02-07 16:14:41 +08:00
|
|
|
The memory.stat file gives accounting information. Now, the number of
|
|
|
|
caches, RSS and Active pages/Inactive pages are shown.
|
|
|
|
|
2008-02-07 16:13:46 +08:00
|
|
|
4. Testing
|
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
For testing features and implementation, see memcg_test.txt.
|
|
|
|
|
|
|
|
Performance test is also important. To see pure memory controller's overhead,
|
|
|
|
testing on tmpfs will give you good numbers of small overheads.
|
|
|
|
Example: do kernel make on tmpfs.
|
|
|
|
|
|
|
|
Page-fault scalability is also important. At measuring parallel
|
|
|
|
page fault test, multi-process test may be better than multi-thread
|
|
|
|
test because it has noise of shared objects/status.
|
|
|
|
|
|
|
|
But the above two are testing extreme situations.
|
|
|
|
Trying usual test under memory controller is always helpful.
|
2008-02-07 16:13:46 +08:00
|
|
|
|
|
|
|
4.1 Troubleshooting
|
|
|
|
|
|
|
|
Sometimes a user might find that the application under a cgroup is
|
2012-10-09 07:33:09 +08:00
|
|
|
terminated by the OOM killer. There are several causes for this:
|
2008-02-07 16:13:46 +08:00
|
|
|
|
|
|
|
1. The cgroup limit is too low (just too low to do anything useful)
|
|
|
|
2. The user is using anonymous memory and swap is turned off or too low
|
|
|
|
|
|
|
|
A sync followed by echo 1 > /proc/sys/vm/drop_caches will help get rid of
|
|
|
|
some of the pages cached in the cgroup (page cache pages).
|
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
To know what happens, disabling OOM_Kill as per "10. OOM Control" (below) and
|
2010-05-27 05:42:40 +08:00
|
|
|
seeing what happens will be helpful.
|
|
|
|
|
2008-02-07 16:13:46 +08:00
|
|
|
4.2 Task migration
|
|
|
|
|
2010-04-23 06:08:02 +08:00
|
|
|
When a task migrates from one cgroup to another, its charge is not
|
2010-03-11 07:22:13 +08:00
|
|
|
carried forward by default. The pages allocated from the original cgroup still
|
2008-02-07 16:13:46 +08:00
|
|
|
remain charged to it, the charge is dropped when the page is freed or
|
|
|
|
reclaimed.
|
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
You can move charges of a task along with task migration.
|
|
|
|
See 8. "Move charges at task migration"
|
2010-03-11 07:22:13 +08:00
|
|
|
|
2008-02-07 16:13:46 +08:00
|
|
|
4.3 Removing a cgroup
|
|
|
|
|
|
|
|
A cgroup can be removed by rmdir, but as discussed in sections 4.1 and 4.2, a
|
|
|
|
cgroup might have some charge associated with it, even though all
|
2010-05-27 05:42:40 +08:00
|
|
|
tasks have migrated away from it. (because we charge against pages, not
|
|
|
|
against tasks.)
|
|
|
|
|
2012-05-30 06:07:04 +08:00
|
|
|
We move the stats to root (if use_hierarchy==0) or parent (if
|
|
|
|
use_hierarchy==1), and no change on the charge except uncharging
|
|
|
|
from the child.
|
2008-02-07 16:13:46 +08:00
|
|
|
|
2009-01-08 10:08:00 +08:00
|
|
|
Charges recorded in swap information is not updated at removal of cgroup.
|
|
|
|
Recorded information is discarded and a cgroup which uses swap (swapcache)
|
|
|
|
will be charged as a new owner of it.
|
|
|
|
|
2012-05-30 06:07:04 +08:00
|
|
|
About use_hierarchy, see Section 6.
|
2009-01-08 10:08:00 +08:00
|
|
|
|
2009-01-08 10:07:55 +08:00
|
|
|
5. Misc. interfaces.
|
|
|
|
|
|
|
|
5.1 force_empty
|
|
|
|
memory.force_empty interface is provided to make cgroup's memory usage empty.
|
|
|
|
When writing anything to this
|
|
|
|
|
|
|
|
# echo 0 > memory.force_empty
|
|
|
|
|
2014-05-12 22:34:17 +08:00
|
|
|
the cgroup will be reclaimed and as many pages reclaimed as possible.
|
2009-01-08 10:07:55 +08:00
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
The typical use case for this interface is before calling rmdir().
|
2009-01-08 10:07:55 +08:00
|
|
|
Because rmdir() moves all pages to parent, some out-of-use page caches can be
|
|
|
|
moved to the parent. If you want to avoid that, force_empty will be useful.
|
|
|
|
|
2012-12-19 06:22:22 +08:00
|
|
|
Also, note that when memory.kmem.limit_in_bytes is set the charges due to
|
|
|
|
kernel pages will still be seen. This is not considered a failure and the
|
|
|
|
write will still return success. In this case, it is expected that
|
|
|
|
memory.kmem.usage_in_bytes == memory.usage_in_bytes.
|
|
|
|
|
2012-05-30 06:07:04 +08:00
|
|
|
About use_hierarchy, see Section 6.
|
|
|
|
|
2009-01-08 10:08:22 +08:00
|
|
|
5.2 stat file
|
2009-04-14 05:40:15 +08:00
|
|
|
|
2011-09-15 07:21:58 +08:00
|
|
|
memory.stat file includes following statistics
|
2009-04-14 05:40:15 +08:00
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
# per-memory cgroup local status
|
2009-04-14 05:40:15 +08:00
|
|
|
cache - # of bytes of page cache memory.
|
2013-05-08 07:18:09 +08:00
|
|
|
rss - # of bytes of anonymous and swap cache memory (includes
|
|
|
|
transparent hugepages).
|
|
|
|
rss_huge - # of bytes of anonymous transparent hugepages.
|
2010-05-27 05:42:40 +08:00
|
|
|
mapped_file - # of bytes of mapped file (includes tmpfs/shmem)
|
2012-01-13 09:18:27 +08:00
|
|
|
pgpgin - # of charging events to the memory cgroup. The charging
|
|
|
|
event happens each time a page is accounted as either mapped
|
|
|
|
anon page(RSS) or cache page(Page Cache) to the cgroup.
|
|
|
|
pgpgout - # of uncharging events to the memory cgroup. The uncharging
|
|
|
|
event happens each time a page is unaccounted from the cgroup.
|
2010-05-27 05:42:40 +08:00
|
|
|
swap - # of bytes of swap usage
|
memcg: add per cgroup dirty page accounting
When modifying PG_Dirty on cached file pages, update the new
MEM_CGROUP_STAT_DIRTY counter. This is done in the same places where
global NR_FILE_DIRTY is managed. The new memcg stat is visible in the
per memcg memory.stat cgroupfs file. The most recent past attempt at
this was http://thread.gmane.org/gmane.linux.kernel.cgroups/8632
The new accounting supports future efforts to add per cgroup dirty
page throttling and writeback. It also helps an administrator break
down a container's memory usage and provides evidence to understand
memcg oom kills (the new dirty count is included in memcg oom kill
messages).
The ability to move page accounting between memcg
(memory.move_charge_at_immigrate) makes this accounting more
complicated than the global counter. The existing
mem_cgroup_{begin,end}_page_stat() lock is used to serialize move
accounting with stat updates.
Typical update operation:
memcg = mem_cgroup_begin_page_stat(page)
if (TestSetPageDirty()) {
[...]
mem_cgroup_update_page_stat(memcg)
}
mem_cgroup_end_page_stat(memcg)
Summary of mem_cgroup_end_page_stat() overhead:
- Without CONFIG_MEMCG it's a no-op
- With CONFIG_MEMCG and no inter memcg task movement, it's just
rcu_read_lock()
- With CONFIG_MEMCG and inter memcg task movement, it's
rcu_read_lock() + spin_lock_irqsave()
A memcg parameter is added to several routines because their callers
now grab mem_cgroup_begin_page_stat() which returns the memcg later
needed by for mem_cgroup_update_page_stat().
Because mem_cgroup_begin_page_stat() may disable interrupts, some
adjustments are needed:
- move __mark_inode_dirty() from __set_page_dirty() to its caller.
__mark_inode_dirty() locking does not want interrupts disabled.
- use spin_lock_irqsave(tree_lock) rather than spin_lock_irq() in
__delete_from_page_cache(), replace_page_cache_page(),
invalidate_complete_page2(), and __remove_mapping().
text data bss dec hex filename
8925147 1774832 1785856 12485835 be84cb vmlinux-!CONFIG_MEMCG-before
8925339 1774832 1785856 12486027 be858b vmlinux-!CONFIG_MEMCG-after
+192 text bytes
8965977 1784992 1785856 12536825 bf4bf9 vmlinux-CONFIG_MEMCG-before
8966750 1784992 1785856 12537598 bf4efe vmlinux-CONFIG_MEMCG-after
+773 text bytes
Performance tests run on v4.0-rc1-36-g4f671fe2f952. Lower is better for
all metrics, they're all wall clock or cycle counts. The read and write
fault benchmarks just measure fault time, they do not include I/O time.
* CONFIG_MEMCG not set:
baseline patched
kbuild 1m25.030000(+-0.088% 3 samples) 1m25.426667(+-0.120% 3 samples)
dd write 100 MiB 0.859211561 +-15.10% 0.874162885 +-15.03%
dd write 200 MiB 1.670653105 +-17.87% 1.669384764 +-11.99%
dd write 1000 MiB 8.434691190 +-14.15% 8.474733215 +-14.77%
read fault cycles 254.0(+-0.000% 10 samples) 253.0(+-0.000% 10 samples)
write fault cycles 2021.2(+-3.070% 10 samples) 1984.5(+-1.036% 10 samples)
* CONFIG_MEMCG=y root_memcg:
baseline patched
kbuild 1m25.716667(+-0.105% 3 samples) 1m25.686667(+-0.153% 3 samples)
dd write 100 MiB 0.855650830 +-14.90% 0.887557919 +-14.90%
dd write 200 MiB 1.688322953 +-12.72% 1.667682724 +-13.33%
dd write 1000 MiB 8.418601605 +-14.30% 8.673532299 +-15.00%
read fault cycles 266.0(+-0.000% 10 samples) 266.0(+-0.000% 10 samples)
write fault cycles 2051.7(+-1.349% 10 samples) 2049.6(+-1.686% 10 samples)
* CONFIG_MEMCG=y non-root_memcg:
baseline patched
kbuild 1m26.120000(+-0.273% 3 samples) 1m25.763333(+-0.127% 3 samples)
dd write 100 MiB 0.861723964 +-15.25% 0.818129350 +-14.82%
dd write 200 MiB 1.669887569 +-13.30% 1.698645885 +-13.27%
dd write 1000 MiB 8.383191730 +-14.65% 8.351742280 +-14.52%
read fault cycles 265.7(+-0.172% 10 samples) 267.0(+-0.000% 10 samples)
write fault cycles 2070.6(+-1.512% 10 samples) 2084.4(+-2.148% 10 samples)
As expected anon page faults are not affected by this patch.
tj: Updated to apply on top of the recent cancel_dirty_page() changes.
Signed-off-by: Sha Zhengju <handai.szj@gmail.com>
Signed-off-by: Greg Thelen <gthelen@google.com>
Signed-off-by: Tejun Heo <tj@kernel.org>
Signed-off-by: Jens Axboe <axboe@fb.com>
2015-05-23 05:13:16 +08:00
|
|
|
dirty - # of bytes that are waiting to get written back to the disk.
|
2013-09-13 06:13:54 +08:00
|
|
|
writeback - # of bytes of file/anon cache that are queued for syncing to
|
|
|
|
disk.
|
2013-06-19 20:34:29 +08:00
|
|
|
inactive_anon - # of bytes of anonymous and swap cache memory on inactive
|
2010-05-27 05:42:40 +08:00
|
|
|
LRU list.
|
|
|
|
active_anon - # of bytes of anonymous and swap cache memory on active
|
2013-06-19 20:34:29 +08:00
|
|
|
LRU list.
|
2010-05-27 05:42:40 +08:00
|
|
|
inactive_file - # of bytes of file-backed memory on inactive LRU list.
|
|
|
|
active_file - # of bytes of file-backed memory on active LRU list.
|
2009-04-14 05:40:15 +08:00
|
|
|
unevictable - # of bytes of memory that cannot be reclaimed (mlocked etc).
|
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
# status considering hierarchy (see memory.use_hierarchy settings)
|
|
|
|
|
|
|
|
hierarchical_memory_limit - # of bytes of memory limit with regard to hierarchy
|
|
|
|
under which the memory cgroup is
|
|
|
|
hierarchical_memsw_limit - # of bytes of memory+swap limit with regard to
|
|
|
|
hierarchy under which memory cgroup is.
|
|
|
|
|
2012-05-30 06:06:26 +08:00
|
|
|
total_<counter> - # hierarchical version of <counter>, which in
|
|
|
|
addition to the cgroup's own value includes the
|
|
|
|
sum of all hierarchical children's values of
|
|
|
|
<counter>, i.e. total_cache
|
2010-05-27 05:42:40 +08:00
|
|
|
|
|
|
|
# The following additional stats are dependent on CONFIG_DEBUG_VM.
|
2009-04-14 05:40:15 +08:00
|
|
|
|
|
|
|
recent_rotated_anon - VM internal parameter. (see mm/vmscan.c)
|
|
|
|
recent_rotated_file - VM internal parameter. (see mm/vmscan.c)
|
|
|
|
recent_scanned_anon - VM internal parameter. (see mm/vmscan.c)
|
|
|
|
recent_scanned_file - VM internal parameter. (see mm/vmscan.c)
|
|
|
|
|
|
|
|
Memo:
|
2010-05-27 05:42:40 +08:00
|
|
|
recent_rotated means recent frequency of LRU rotation.
|
|
|
|
recent_scanned means recent # of scans to LRU.
|
2009-01-08 10:08:22 +08:00
|
|
|
showing for better debug please see the code for meanings.
|
|
|
|
|
2009-04-14 05:40:15 +08:00
|
|
|
Note:
|
|
|
|
Only anonymous and swap cache memory is listed as part of 'rss' stat.
|
|
|
|
This should not be confused with the true 'resident set size' or the
|
2010-05-27 05:42:40 +08:00
|
|
|
amount of physical memory used by the cgroup.
|
|
|
|
'rss + file_mapped" will give you resident set size of cgroup.
|
|
|
|
(Note: file and shmem may be shared among other cgroups. In that case,
|
|
|
|
file_mapped is accounted only when the memory cgroup is owner of page
|
|
|
|
cache.)
|
2009-01-08 10:08:22 +08:00
|
|
|
|
2009-01-08 10:08:24 +08:00
|
|
|
5.3 swappiness
|
|
|
|
|
2014-06-07 05:38:15 +08:00
|
|
|
Overrides /proc/sys/vm/swappiness for the particular group. The tunable
|
|
|
|
in the root cgroup corresponds to the global swappiness setting.
|
|
|
|
|
|
|
|
Please note that unlike during the global reclaim, limit reclaim
|
|
|
|
enforces that 0 swappiness really prevents from any swapping even if
|
|
|
|
there is a swap storage available. This might lead to memcg OOM killer
|
|
|
|
if there are no file pages to reclaim.
|
2009-01-08 10:08:24 +08:00
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
5.4 failcnt
|
|
|
|
|
|
|
|
A memory cgroup provides memory.failcnt and memory.memsw.failcnt files.
|
|
|
|
This failcnt(== failure count) shows the number of times that a usage counter
|
|
|
|
hit its limit. When a memory cgroup hits a limit, failcnt increases and
|
|
|
|
memory under it will be reclaimed.
|
|
|
|
|
|
|
|
You can reset failcnt by writing 0 to failcnt file.
|
|
|
|
# echo 0 > .../memory.failcnt
|
2009-01-08 10:08:24 +08:00
|
|
|
|
2011-04-28 06:26:48 +08:00
|
|
|
5.5 usage_in_bytes
|
|
|
|
|
|
|
|
For efficiency, as other kernel components, memory cgroup uses some optimization
|
|
|
|
to avoid unnecessary cacheline false sharing. usage_in_bytes is affected by the
|
2012-10-09 07:33:09 +08:00
|
|
|
method and doesn't show 'exact' value of memory (and swap) usage, it's a fuzz
|
2011-04-28 06:26:48 +08:00
|
|
|
value for efficient access. (Of course, when necessary, it's synchronized.)
|
|
|
|
If you want to know more exact memory usage, you should use RSS+CACHE(+SWAP)
|
|
|
|
value in memory.stat(see 5.2).
|
|
|
|
|
2011-06-16 06:08:16 +08:00
|
|
|
5.6 numa_stat
|
|
|
|
|
|
|
|
This is similar to numa_maps but operates on a per-memcg basis. This is
|
|
|
|
useful for providing visibility into the numa locality information within
|
|
|
|
an memcg since the pages are allowed to be allocated from any physical
|
2012-10-09 07:33:09 +08:00
|
|
|
node. One of the use cases is evaluating application performance by
|
|
|
|
combining this information with the application's CPU allocation.
|
2011-06-16 06:08:16 +08:00
|
|
|
|
2013-11-13 07:07:41 +08:00
|
|
|
Each memcg's numa_stat file includes "total", "file", "anon" and "unevictable"
|
|
|
|
per-node page counts including "hierarchical_<counter>" which sums up all
|
|
|
|
hierarchical children's values in addition to the memcg's own value.
|
|
|
|
|
2013-12-21 23:57:33 +08:00
|
|
|
The output format of memory.numa_stat is:
|
2011-06-16 06:08:16 +08:00
|
|
|
|
|
|
|
total=<total pages> N0=<node 0 pages> N1=<node 1 pages> ...
|
|
|
|
file=<total file pages> N0=<node 0 pages> N1=<node 1 pages> ...
|
|
|
|
anon=<total anon pages> N0=<node 0 pages> N1=<node 1 pages> ...
|
|
|
|
unevictable=<total anon pages> N0=<node 0 pages> N1=<node 1 pages> ...
|
2013-11-13 07:07:41 +08:00
|
|
|
hierarchical_<counter>=<counter pages> N0=<node 0 pages> N1=<node 1 pages> ...
|
2011-06-16 06:08:16 +08:00
|
|
|
|
2013-11-13 07:07:41 +08:00
|
|
|
The "total" count is sum of file + anon + unevictable.
|
2011-06-16 06:08:16 +08:00
|
|
|
|
2009-01-08 10:08:03 +08:00
|
|
|
6. Hierarchy support
|
2009-01-08 10:07:55 +08:00
|
|
|
|
2009-01-08 10:08:03 +08:00
|
|
|
The memory controller supports a deep hierarchy and hierarchical accounting.
|
|
|
|
The hierarchy is created by creating the appropriate cgroups in the
|
|
|
|
cgroup filesystem. Consider for example, the following cgroup filesystem
|
|
|
|
hierarchy
|
|
|
|
|
2011-06-16 04:00:47 +08:00
|
|
|
root
|
2009-01-08 10:08:03 +08:00
|
|
|
/ | \
|
2011-06-16 04:00:47 +08:00
|
|
|
/ | \
|
|
|
|
a b c
|
|
|
|
| \
|
|
|
|
| \
|
|
|
|
d e
|
2009-01-08 10:08:03 +08:00
|
|
|
|
|
|
|
In the diagram above, with hierarchical accounting enabled, all memory
|
|
|
|
usage of e, is accounted to its ancestors up until the root (i.e, c and root),
|
2010-05-27 05:42:40 +08:00
|
|
|
that has memory.use_hierarchy enabled. If one of the ancestors goes over its
|
2009-01-08 10:08:03 +08:00
|
|
|
limit, the reclaim algorithm reclaims from the tasks in the ancestor and the
|
|
|
|
children of the ancestor.
|
|
|
|
|
|
|
|
6.1 Enabling hierarchical accounting and reclaim
|
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
A memory cgroup by default disables the hierarchy feature. Support
|
2009-01-08 10:08:03 +08:00
|
|
|
can be enabled by writing 1 to memory.use_hierarchy file of the root cgroup
|
|
|
|
|
|
|
|
# echo 1 > memory.use_hierarchy
|
|
|
|
|
|
|
|
The feature can be disabled by
|
|
|
|
|
|
|
|
# echo 0 > memory.use_hierarchy
|
|
|
|
|
2011-02-17 09:51:23 +08:00
|
|
|
NOTE1: Enabling/disabling will fail if either the cgroup already has other
|
|
|
|
cgroups created below it, or if the parent cgroup has use_hierarchy
|
|
|
|
enabled.
|
2009-01-08 10:08:03 +08:00
|
|
|
|
memcg: handle panic_on_oom=always case
Presently, if panic_on_oom=2, the whole system panics even if the oom
happend in some special situation (as cpuset, mempolicy....). Then,
panic_on_oom=2 means painc_on_oom_always.
Now, memcg doesn't check panic_on_oom flag. This patch adds a check.
BTW, how it's useful ?
kdump+panic_on_oom=2 is the last tool to investigate what happens in
oom-ed system. When a task is killed, the sysytem recovers and there will
be few hint to know what happnes. In mission critical system, oom should
never happen. Then, panic_on_oom=2+kdump is useful to avoid next OOM by
knowing precise information via snapshot.
TODO:
- For memcg, it's for isolate system's memory usage, oom-notiifer and
freeze_at_oom (or rest_at_oom) should be implemented. Then, management
daemon can do similar jobs (as kdump) or taking snapshot per cgroup.
Signed-off-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Balbir Singh <balbir@linux.vnet.ibm.com>
Cc: David Rientjes <rientjes@google.com>
Cc: Nick Piggin <npiggin@suse.de>
Reviewed-by: Daisuke Nishimura <nishimura@mxp.nes.nec.co.jp>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2010-03-11 07:22:32 +08:00
|
|
|
NOTE2: When panic_on_oom is set to "2", the whole system will panic in
|
2010-05-27 05:42:40 +08:00
|
|
|
case of an OOM event in any cgroup.
|
2009-01-08 10:08:03 +08:00
|
|
|
|
2009-09-24 06:56:34 +08:00
|
|
|
7. Soft limits
|
|
|
|
|
|
|
|
Soft limits allow for greater sharing of memory. The idea behind soft limits
|
|
|
|
is to allow control groups to use as much of the memory as needed, provided
|
|
|
|
|
|
|
|
a. There is no memory contention
|
|
|
|
b. They do not exceed their hard limit
|
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
When the system detects memory contention or low memory, control groups
|
2009-09-24 06:56:34 +08:00
|
|
|
are pushed back to their soft limits. If the soft limit of each control
|
|
|
|
group is very high, they are pushed back as much as possible to make
|
|
|
|
sure that one control group does not starve the others of memory.
|
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
Please note that soft limits is a best-effort feature; it comes with
|
2009-09-24 06:56:34 +08:00
|
|
|
no guarantees, but it does its best to make sure that when memory is
|
|
|
|
heavily contended for, memory is allocated based on the soft limit
|
2012-10-09 07:33:09 +08:00
|
|
|
hints/setup. Currently soft limit based reclaim is set up such that
|
2009-09-24 06:56:34 +08:00
|
|
|
it gets invoked from balance_pgdat (kswapd).
|
|
|
|
|
|
|
|
7.1 Interface
|
|
|
|
|
|
|
|
Soft limits can be setup by using the following commands (in this example we
|
2010-05-27 05:42:40 +08:00
|
|
|
assume a soft limit of 256 MiB)
|
2009-09-24 06:56:34 +08:00
|
|
|
|
|
|
|
# echo 256M > memory.soft_limit_in_bytes
|
|
|
|
|
|
|
|
If we want to change this to 1G, we can at any time use
|
|
|
|
|
|
|
|
# echo 1G > memory.soft_limit_in_bytes
|
|
|
|
|
|
|
|
NOTE1: Soft limits take effect over a long period of time, since they involve
|
|
|
|
reclaiming memory for balancing between memory cgroups
|
|
|
|
NOTE2: It is recommended to set the soft limit always below the hard limit,
|
|
|
|
otherwise the hard limit will take precedence.
|
|
|
|
|
2010-03-11 07:22:13 +08:00
|
|
|
8. Move charges at task migration
|
|
|
|
|
|
|
|
Users can move charges associated with a task along with task migration, that
|
|
|
|
is, uncharge task's pages from the old cgroup and charge them to the new cgroup.
|
2010-03-11 07:22:17 +08:00
|
|
|
This feature is not supported in !CONFIG_MMU environments because of lack of
|
|
|
|
page tables.
|
2010-03-11 07:22:13 +08:00
|
|
|
|
|
|
|
8.1 Interface
|
|
|
|
|
2013-12-21 23:57:33 +08:00
|
|
|
This feature is disabled by default. It can be enabled (and disabled again) by
|
2010-03-11 07:22:13 +08:00
|
|
|
writing to memory.move_charge_at_immigrate of the destination cgroup.
|
|
|
|
|
|
|
|
If you want to enable it:
|
|
|
|
|
|
|
|
# echo (some positive value) > memory.move_charge_at_immigrate
|
|
|
|
|
|
|
|
Note: Each bits of move_charge_at_immigrate has its own meaning about what type
|
|
|
|
of charges should be moved. See 8.2 for details.
|
2012-10-09 07:33:09 +08:00
|
|
|
Note: Charges are moved only when you move mm->owner, in other words,
|
|
|
|
a leader of a thread group.
|
2010-03-11 07:22:13 +08:00
|
|
|
Note: If we cannot find enough space for the task in the destination cgroup, we
|
|
|
|
try to make space by reclaiming memory. Task migration may fail if we
|
|
|
|
cannot make enough space.
|
2010-05-27 05:42:40 +08:00
|
|
|
Note: It can take several seconds if you move charges much.
|
2010-03-11 07:22:13 +08:00
|
|
|
|
|
|
|
And if you want disable it again:
|
|
|
|
|
|
|
|
# echo 0 > memory.move_charge_at_immigrate
|
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
8.2 Type of charges which can be moved
|
2010-03-11 07:22:13 +08:00
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
Each bit in move_charge_at_immigrate has its own meaning about what type of
|
|
|
|
charges should be moved. But in any case, it must be noted that an account of
|
|
|
|
a page or a swap can be moved only when it is charged to the task's current
|
|
|
|
(old) memory cgroup.
|
2010-03-11 07:22:13 +08:00
|
|
|
|
|
|
|
bit | what type of charges would be moved ?
|
|
|
|
-----+------------------------------------------------------------------------
|
2012-10-09 07:33:09 +08:00
|
|
|
0 | A charge of an anonymous page (or swap of it) used by the target task.
|
|
|
|
| You must enable Swap Extension (see 2.4) to enable move of swap charges.
|
2010-05-27 05:42:39 +08:00
|
|
|
-----+------------------------------------------------------------------------
|
2012-10-09 07:33:09 +08:00
|
|
|
1 | A charge of file pages (normal file, tmpfs file (e.g. ipc shared memory)
|
2010-05-27 05:42:40 +08:00
|
|
|
| and swaps of tmpfs file) mmapped by the target task. Unlike the case of
|
2012-10-09 07:33:09 +08:00
|
|
|
| anonymous pages, file pages (and swaps) in the range mmapped by the task
|
2010-05-27 05:42:39 +08:00
|
|
|
| will be moved even if the task hasn't done page fault, i.e. they might
|
|
|
|
| not be the task's "RSS", but other task's "RSS" that maps the same file.
|
2012-10-09 07:33:09 +08:00
|
|
|
| And mapcount of the page is ignored (the page can be moved even if
|
|
|
|
| page_mapcount(page) > 1). You must enable Swap Extension (see 2.4) to
|
2010-05-27 05:42:39 +08:00
|
|
|
| enable move of swap charges.
|
2010-03-11 07:22:13 +08:00
|
|
|
|
|
|
|
8.3 TODO
|
|
|
|
|
|
|
|
- All of moving charge operations are done under cgroup_mutex. It's not good
|
|
|
|
behavior to hold the mutex too long, so we may need some trick.
|
|
|
|
|
2010-03-11 07:22:24 +08:00
|
|
|
9. Memory thresholds
|
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
Memory cgroup implements memory thresholds using the cgroups notification
|
2010-03-11 07:22:24 +08:00
|
|
|
API (see cgroups.txt). It allows to register multiple memory and memsw
|
|
|
|
thresholds and gets notifications when it crosses.
|
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
To register a threshold, an application must:
|
2010-05-27 05:42:40 +08:00
|
|
|
- create an eventfd using eventfd(2);
|
|
|
|
- open memory.usage_in_bytes or memory.memsw.usage_in_bytes;
|
|
|
|
- write string like "<event_fd> <fd of memory.usage_in_bytes> <threshold>" to
|
|
|
|
cgroup.event_control.
|
2010-03-11 07:22:24 +08:00
|
|
|
|
|
|
|
Application will be notified through eventfd when memory usage crosses
|
|
|
|
threshold in any direction.
|
|
|
|
|
|
|
|
It's applicable for root and non-root cgroup.
|
|
|
|
|
2010-05-27 05:42:36 +08:00
|
|
|
10. OOM Control
|
|
|
|
|
2010-05-27 05:42:37 +08:00
|
|
|
memory.oom_control file is for OOM notification and other controls.
|
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
Memory cgroup implements OOM notifier using the cgroup notification
|
2010-05-27 05:42:40 +08:00
|
|
|
API (See cgroups.txt). It allows to register multiple OOM notification
|
|
|
|
delivery and gets notification when OOM happens.
|
2010-05-27 05:42:36 +08:00
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
To register a notifier, an application must:
|
2010-05-27 05:42:36 +08:00
|
|
|
- create an eventfd using eventfd(2)
|
|
|
|
- open memory.oom_control file
|
2010-05-27 05:42:40 +08:00
|
|
|
- write string like "<event_fd> <fd of memory.oom_control>" to
|
|
|
|
cgroup.event_control
|
2010-05-27 05:42:36 +08:00
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
The application will be notified through eventfd when OOM happens.
|
|
|
|
OOM notification doesn't work for the root cgroup.
|
2010-05-27 05:42:36 +08:00
|
|
|
|
2012-10-09 07:33:09 +08:00
|
|
|
You can disable the OOM-killer by writing "1" to memory.oom_control file, as:
|
2010-05-27 05:42:40 +08:00
|
|
|
|
2010-05-27 05:42:37 +08:00
|
|
|
#echo 1 > memory.oom_control
|
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
If OOM-killer is disabled, tasks under cgroup will hang/sleep
|
|
|
|
in memory cgroup's OOM-waitqueue when they request accountable memory.
|
2010-05-27 05:42:37 +08:00
|
|
|
|
2010-05-27 05:42:40 +08:00
|
|
|
For running them, you have to relax the memory cgroup's OOM status by
|
2010-05-27 05:42:37 +08:00
|
|
|
* enlarge limit or reduce usage.
|
|
|
|
To reduce usage,
|
|
|
|
* kill some tasks.
|
|
|
|
* move some tasks to other group with account migration.
|
|
|
|
* remove some files (on tmpfs?)
|
|
|
|
|
|
|
|
Then, stopped tasks will work again.
|
|
|
|
|
|
|
|
At reading, current status of OOM is shown.
|
|
|
|
oom_kill_disable 0 or 1 (if 1, oom-killer is disabled)
|
2010-05-27 05:42:40 +08:00
|
|
|
under_oom 0 or 1 (if 1, the memory cgroup is under OOM, tasks may
|
2010-05-27 05:42:37 +08:00
|
|
|
be stopped.)
|
2010-05-27 05:42:36 +08:00
|
|
|
|
memcg: add memory.pressure_level events
With this patch userland applications that want to maintain the
interactivity/memory allocation cost can use the pressure level
notifications. The levels are defined like this:
The "low" level means that the system is reclaiming memory for new
allocations. Monitoring this reclaiming activity might be useful for
maintaining cache level. Upon notification, the program (typically
"Activity Manager") might analyze vmstat and act in advance (i.e.
prematurely shutdown unimportant services).
The "medium" level means that the system is experiencing medium memory
pressure, the system might be making swap, paging out active file
caches, etc. Upon this event applications may decide to further analyze
vmstat/zoneinfo/memcg or internal memory usage statistics and free any
resources that can be easily reconstructed or re-read from a disk.
The "critical" level means that the system is actively thrashing, it is
about to out of memory (OOM) or even the in-kernel OOM killer is on its
way to trigger. Applications should do whatever they can to help the
system. It might be too late to consult with vmstat or any other
statistics, so it's advisable to take an immediate action.
The events are propagated upward until the event is handled, i.e. the
events are not pass-through. Here is what this means: for example you
have three cgroups: A->B->C. Now you set up an event listener on
cgroups A, B and C, and suppose group C experiences some pressure. In
this situation, only group C will receive the notification, i.e. groups
A and B will not receive it. This is done to avoid excessive
"broadcasting" of messages, which disturbs the system and which is
especially bad if we are low on memory or thrashing. So, organize the
cgroups wisely, or propagate the events manually (or, ask us to
implement the pass-through events, explaining why would you need them.)
Performance wise, the memory pressure notifications feature itself is
lightweight and does not require much of bookkeeping, in contrast to the
rest of memcg features. Unfortunately, as of current memcg
implementation, pages accounting is an inseparable part and cannot be
turned off. The good news is that there are some efforts[1] to improve
the situation; plus, implementing the same, fully API-compatible[2]
interface for CONFIG_MEMCG=n case (e.g. embedded) is also a viable
option, so it will not require any changes on the userland side.
[1] http://permalink.gmane.org/gmane.linux.kernel.cgroups/6291
[2] http://lkml.org/lkml/2013/2/21/454
[akpm@linux-foundation.org: coding-style fixes]
[akpm@linux-foundation.org: fix CONFIG_CGROPUPS=n warnings]
Signed-off-by: Anton Vorontsov <anton.vorontsov@linaro.org>
Acked-by: Kirill A. Shutemov <kirill@shutemov.name>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Tejun Heo <tj@kernel.org>
Cc: David Rientjes <rientjes@google.com>
Cc: Pekka Enberg <penberg@kernel.org>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Glauber Costa <glommer@parallels.com>
Cc: Michal Hocko <mhocko@suse.cz>
Cc: Luiz Capitulino <lcapitulino@redhat.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Leonid Moiseichuk <leonid.moiseichuk@nokia.com>
Cc: KOSAKI Motohiro <kosaki.motohiro@gmail.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Bartlomiej Zolnierkiewicz <b.zolnierkie@samsung.com>
Cc: John Stultz <john.stultz@linaro.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-04-30 06:08:31 +08:00
|
|
|
11. Memory Pressure
|
|
|
|
|
|
|
|
The pressure level notifications can be used to monitor the memory
|
|
|
|
allocation cost; based on the pressure, applications can implement
|
|
|
|
different strategies of managing their memory resources. The pressure
|
|
|
|
levels are defined as following:
|
|
|
|
|
|
|
|
The "low" level means that the system is reclaiming memory for new
|
|
|
|
allocations. Monitoring this reclaiming activity might be useful for
|
|
|
|
maintaining cache level. Upon notification, the program (typically
|
|
|
|
"Activity Manager") might analyze vmstat and act in advance (i.e.
|
|
|
|
prematurely shutdown unimportant services).
|
|
|
|
|
|
|
|
The "medium" level means that the system is experiencing medium memory
|
|
|
|
pressure, the system might be making swap, paging out active file caches,
|
|
|
|
etc. Upon this event applications may decide to further analyze
|
|
|
|
vmstat/zoneinfo/memcg or internal memory usage statistics and free any
|
|
|
|
resources that can be easily reconstructed or re-read from a disk.
|
|
|
|
|
|
|
|
The "critical" level means that the system is actively thrashing, it is
|
|
|
|
about to out of memory (OOM) or even the in-kernel OOM killer is on its
|
|
|
|
way to trigger. Applications should do whatever they can to help the
|
|
|
|
system. It might be too late to consult with vmstat or any other
|
|
|
|
statistics, so it's advisable to take an immediate action.
|
|
|
|
|
|
|
|
The events are propagated upward until the event is handled, i.e. the
|
|
|
|
events are not pass-through. Here is what this means: for example you have
|
|
|
|
three cgroups: A->B->C. Now you set up an event listener on cgroups A, B
|
|
|
|
and C, and suppose group C experiences some pressure. In this situation,
|
|
|
|
only group C will receive the notification, i.e. groups A and B will not
|
|
|
|
receive it. This is done to avoid excessive "broadcasting" of messages,
|
|
|
|
which disturbs the system and which is especially bad if we are low on
|
|
|
|
memory or thrashing. So, organize the cgroups wisely, or propagate the
|
|
|
|
events manually (or, ask us to implement the pass-through events,
|
|
|
|
explaining why would you need them.)
|
|
|
|
|
|
|
|
The file memory.pressure_level is only used to setup an eventfd. To
|
|
|
|
register a notification, an application must:
|
|
|
|
|
|
|
|
- create an eventfd using eventfd(2);
|
|
|
|
- open memory.pressure_level;
|
|
|
|
- write string like "<event_fd> <fd of memory.pressure_level> <level>"
|
|
|
|
to cgroup.event_control.
|
|
|
|
|
|
|
|
Application will be notified through eventfd when memory pressure is at
|
|
|
|
the specific level (or higher). Read/write operations to
|
|
|
|
memory.pressure_level are no implemented.
|
|
|
|
|
|
|
|
Test:
|
|
|
|
|
|
|
|
Here is a small script example that makes a new cgroup, sets up a
|
|
|
|
memory limit, sets up a notification in the cgroup and then makes child
|
|
|
|
cgroup experience a critical pressure:
|
|
|
|
|
|
|
|
# cd /sys/fs/cgroup/memory/
|
|
|
|
# mkdir foo
|
|
|
|
# cd foo
|
|
|
|
# cgroup_event_listener memory.pressure_level low &
|
|
|
|
# echo 8000000 > memory.limit_in_bytes
|
|
|
|
# echo 8000000 > memory.memsw.limit_in_bytes
|
|
|
|
# echo $$ > tasks
|
|
|
|
# dd if=/dev/zero | read x
|
|
|
|
|
|
|
|
(Expect a bunch of notifications, and eventually, the oom-killer will
|
|
|
|
trigger.)
|
|
|
|
|
|
|
|
12. TODO
|
2008-02-07 16:13:46 +08:00
|
|
|
|
2013-07-04 06:02:25 +08:00
|
|
|
1. Make per-cgroup scanner reclaim not-shared pages first
|
|
|
|
2. Teach controller to account for shared-pages
|
|
|
|
3. Start reclamation in the background when the limit is
|
2008-02-07 16:13:46 +08:00
|
|
|
not yet hit but the usage is getting closer
|
|
|
|
|
|
|
|
Summary
|
|
|
|
|
|
|
|
Overall, the memory controller has been a stable controller and has been
|
|
|
|
commented and discussed quite extensively in the community.
|
|
|
|
|
|
|
|
References
|
|
|
|
|
|
|
|
1. Singh, Balbir. RFC: Memory Controller, http://lwn.net/Articles/206697/
|
|
|
|
2. Singh, Balbir. Memory Controller (RSS Control),
|
|
|
|
http://lwn.net/Articles/222762/
|
|
|
|
3. Emelianov, Pavel. Resource controllers based on process cgroups
|
|
|
|
http://lkml.org/lkml/2007/3/6/198
|
|
|
|
4. Emelianov, Pavel. RSS controller based on process cgroups (v2)
|
2008-02-24 07:24:12 +08:00
|
|
|
http://lkml.org/lkml/2007/4/9/78
|
2008-02-07 16:13:46 +08:00
|
|
|
5. Emelianov, Pavel. RSS controller based on process cgroups (v3)
|
|
|
|
http://lkml.org/lkml/2007/5/30/244
|
|
|
|
6. Menage, Paul. Control Groups v10, http://lwn.net/Articles/236032/
|
|
|
|
7. Vaidyanathan, Srinivasan, Control Groups: Pagecache accounting and control
|
|
|
|
subsystem (v3), http://lwn.net/Articles/235534/
|
2008-02-24 07:24:12 +08:00
|
|
|
8. Singh, Balbir. RSS controller v2 test results (lmbench),
|
2008-02-07 16:13:46 +08:00
|
|
|
http://lkml.org/lkml/2007/5/17/232
|
2008-02-24 07:24:12 +08:00
|
|
|
9. Singh, Balbir. RSS controller v2 AIM9 results
|
2008-02-07 16:13:46 +08:00
|
|
|
http://lkml.org/lkml/2007/5/18/1
|
2008-02-24 07:24:12 +08:00
|
|
|
10. Singh, Balbir. Memory controller v6 test results,
|
2008-02-07 16:13:46 +08:00
|
|
|
http://lkml.org/lkml/2007/8/19/36
|
2008-02-24 07:24:12 +08:00
|
|
|
11. Singh, Balbir. Memory controller introduction (v6),
|
|
|
|
http://lkml.org/lkml/2007/8/17/69
|
2008-02-07 16:13:46 +08:00
|
|
|
12. Corbet, Jonathan, Controlling memory use in cgroups,
|
|
|
|
http://lwn.net/Articles/243795/
|