memcg: Slow down swap allocation as the available space gets depleted
Subsystems (5)
v6 cover memcg: Slow down swap allocation as the available space gets depleted
Tejun describes the problem as follows:
When swap runs out, there's an abrupt change in system behavior - the anonymous memory suddenly becomes unmanageable which readily breaks any sort of memory isolation and can bring down the whole system. To avoid that, oomd [1] monitors free swap space and triggers kills when it drops below the specific threshold (e.g. 15%).
While this works, it's far from ideal:
- Depending on IO performance and total swap size, a given headroom might not be enough or too much.
- oomd has to monitor swap depletion in addition to the usual pressure metrics and it currently doesn't consider memory.swap.max.
Solve this by adapting parts of the approach that memory.high uses - slow down allocation as the resource gets depleted turning the depletion behavior from abrupt cliff one to gradual degradation observable through memory pressure metric.
[1] https://github.com/facebookincubator/oomd
v5: https://lore.kernel.org/linux-mm/20200521002411.3963032-1-kuba-DgEjT+Ai2ygdnm+yROfE0A@public.gmane.org/
v4: https://lore.kernel.org/linux-mm/20200519171938.3569605-1-kuba-DgEjT+Ai2ygdnm+yROfE0A@public.gmane.org/
v3: https://lore.kernel.org/linux-mm/20200515202027.3217470-1-kuba-DgEjT+Ai2ygdnm+yROfE0A@public.gmane.org/
v2: https://lore.kernel.org/linux-mm/20200511225516.2431921-1-kuba-DgEjT+Ai2ygdnm+yROfE0A@public.gmane.org/
v1: https://lore.kernel.org/linux-mm/20200417010617.927266-1-kuba-DgEjT+Ai2ygdnm+yROfE0A@public.gmane.org/
Jakub Kicinski (4):
mm: prepare for swap over-high accounting and penalty calculation
mm: move penalty delay clamping out of calculate_high_delay()
mm: move cgroup high memory limit setting into struct page_counter
mm: automatically penalize tasks with high swap use
Documentation/admin-guide/cgroup-v2.rst | 20 +++ include/linux/memcontrol.h | 4 +- include/linux/page_counter.h | 8 ++ mm/memcontrol.c | 177 ++++++++++++++++++------ 4 files changed, 160 insertions(+), 49 deletions(-)
Signature · 1 line
2.25.4
PATCH v6 1/4 mm: prepare for swap over-high accounting and penalty calculation
Slice the memory overage calculation logic a little bit so we can reuse it to apply a similar penalty to the swap. The logic which accesses the memory-specific fields (use and high values) has to be taken out of calculate_high_delay().
--- mm/memcontrol.c | 62 ++++++++++++++++++++++++++++--------------------- 1 file changed, 35 insertions(+), 27 deletions(-)
mm/memcontrol.c +35 -27
@@ -2302,41 +2302,48 @@ static void high_work_func(struct work_struct *work)#define MEMCG_DELAY_PRECISION_SHIFT 20#define MEMCG_DELAY_SCALING_SHIFT 14 -/* -* Get the number of jiffies that we should penalise a mischievous cgroup which -* is exceeding its memory.high by checking both it and its ancestors. -*/ -static unsigned long calculate_high_delay (struct mem_cgroup *memcg, -unsigned int nr_pages) +static u64 calculate_overage (unsigned long usage,unsigned long high) { -unsigned long penalty_jiffies; -u64 max_overage =0 ; - -do { -unsigned long usage, high; -u64 overage; +u64 overage; - usage =page_counter_read (&memcg->memory); - high =READ_ONCE (memcg->high); +if (usage <= high) +return 0 ; -if (usage <= high) -continue ; +/* +* Prevent division by 0 in overage calculation by acting as if +* it was a threshold of 1 page +*/ + high =max (high,1UL ); -/* -* Prevent division by 0 in overage calculation by acting as if -* it was a threshold of 1 page -*/ - high =max (high,1UL ); + overage = usage - high; + overage <<=MEMCG_DELAY_PRECISION_SHIFT ; +return div64_u64 (overage, high); +} - overage = usage - high; - overage <<=MEMCG_DELAY_PRECISION_SHIFT ; - overage =div64_u64 (overage, high); +static u64 mem_find_max_overage (struct mem_cgroup *memcg) +{ +u64 overage, max_overage =0 ; -if (overage > max_overage) - max_overage = overage; +do { + overage =calculate_overage (page_counter_read (&memcg->memory), +READ_ONCE (memcg->high)); + max_overage =max (overage, max_overage); }while ((memcg =parent_mem_cgroup (memcg)) && !mem_cgroup_is_root (memcg)); +return max_overage; +} + +/* +* Get the number of jiffies that we should penalise a mischievous cgroup which +* is exceeding its memory.high by checking both it and its ancestors. +*/ +static unsigned long calculate_high_delay (struct mem_cgroup *memcg, +unsigned int nr_pages, +u64 max_overage) +{ +unsigned long penalty_jiffies; +if (!max_overage)return 0 ;
@@ -2392,7 +2399,8 @@ void mem_cgroup_handle_over_high(void)* memory.high is breached and reclaim is unable to keep up. Throttle * allocators proactively to slow down excessive growth. */ - penalty_jiffies =calculate_high_delay (memcg, nr_pages); + penalty_jiffies =calculate_high_delay (memcg, nr_pages, +mem_find_max_overage (memcg));/* * Don't sleep if the amount of jiffies this memcg owes us is so low
Signature · 1 line
2.25.4
PATCH v6 2/4 mm: move penalty delay clamping out of calculate_high_delay()
In reply to Jakub KicinskiWe will want to call calculate_high_delay() twice - once for memory and once for swap, and we should apply the clamp value to sum of the penalties. Clamping has to be applied outside of calculate_high_delay().
--- mm/memcontrol.c | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-)
mm/memcontrol.c +8 -8
@@ -2367,14 +2367,7 @@ static unsigned long calculate_high_delay(struct mem_cgroup *memcg,* MEMCG_CHARGE_BATCH pages is nominal, so work out how much smaller or * larger the current charge patch is than that. */ - penalty_jiffies = penalty_jiffies * nr_pages /MEMCG_CHARGE_BATCH ; - -/* -* Clamp the max delay per usermode return so as to still keep the -* application moving forwards and also permit diagnostics, albeit -* extremely slowly. -*/ -return min (penalty_jiffies,MEMCG_MAX_HIGH_DELAY_JIFFIES ); +return penalty_jiffies * nr_pages /MEMCG_CHARGE_BATCH ; }/*
@@ -2402,6 +2395,13 @@ void mem_cgroup_handle_over_high(void) penalty_jiffies =calculate_high_delay (memcg, nr_pages,mem_find_max_overage (memcg)); +/* +* Clamp the max delay per usermode return so as to still keep the +* application moving forwards and also permit diagnostics, albeit +* extremely slowly. +*/ + penalty_jiffies =min (penalty_jiffies,MEMCG_MAX_HIGH_DELAY_JIFFIES ); +/* * Don't sleep if the amount of jiffies this memcg owes us is so low * that it's not even worth doing, in an attempt to be nice to those who
Signature · 1 line
2.25.4
PATCH v6 3/4 mm: move cgroup high memory limit setting into struct page_counter
In reply to Jakub KicinskiHigh memory limit is currently recorded directly in struct mem_cgroup. We are about to add a high limit for swap, move the field to struct page_counter and add some helpers.
--
v6: remove page_counter_is_above_high()
v5: make page_counter_set_high() a static inline in the header
v4: new patch
--- include/linux/memcontrol.h | 3 --- include/linux/page_counter.h | 8 ++++++++ mm/memcontrol.c | 19 +++++++++++-------- 3 files changed, 19 insertions(+), 11 deletions(-)
include/linux/memcontrol.h +0 -3
@@ -212,9 +212,6 @@ struct mem_cgroup {struct page_counter kmem;struct page_counter tcpmem; -/* Upper bound of normal memory consumption range */ -unsigned long high; -/* Range enforcement for interrupt charges */ struct work_struct high_work;
include/linux/page_counter.h +8 -0
@@ -10,6 +10,7 @@ struct page_counter {atomic_long_t usage;unsigned long min;unsigned long low; +unsigned long high;unsigned long max;struct page_counter *parent;
@@ -55,6 +56,13 @@ bool page_counter_try_charge(struct page_counter *counter,void page_counter_uncharge (struct page_counter *counter,unsigned long nr_pages);void page_counter_set_min (struct page_counter *counter,unsigned long nr_pages);void page_counter_set_low (struct page_counter *counter,unsigned long nr_pages); + +static inline void page_counter_set_high (struct page_counter *counter, +unsigned long nr_pages) +{ +WRITE_ONCE (counter->high, nr_pages); +} +int page_counter_set_max (struct page_counter *counter,unsigned long nr_pages);int page_counter_memparse (const char *buf,const char *max,unsigned long *nr_pages);
mm/memcontrol.c +11 -8
@@ -2233,7 +2233,8 @@ static void reclaim_high(struct mem_cgroup *memcg, gfp_t gfp_mask) { do { - if (page_counter_read(&memcg->memory) <= READ_ONCE(memcg->high)) + if (page_counter_read(&memcg->memory) <= + READ_ONCE(memcg->memory.high)) continue; memcg_memory_event(memcg, MEMCG_HIGH); try_to_free_mem_cgroup_pages(memcg, nr_pages, gfp_mask, true);
@@ -2326,7 +2327,7 @@ static u64 mem_find_max_overage(struct mem_cgroup *memcg)do { overage =calculate_overage (page_counter_read (&memcg->memory), -READ_ONCE (memcg->high)); +READ_ONCE (memcg->memory.high)); max_overage =max (overage, max_overage); }while ((memcg =parent_mem_cgroup (memcg)) && !mem_cgroup_is_root (memcg));
@@ -2585,7 +2586,8 @@ static int try_charge(struct mem_cgroup *memcg, gfp_t gfp_mask,* reclaim, the cost of mismatch is negligible. */ do { - if (page_counter_read(&memcg->memory) > READ_ONCE(memcg->high)) { + if (page_counter_read(&memcg->memory) > + READ_ONCE(memcg->memory.high)) { /* Don't bother a random interrupted task */ if (in_interrupt()) { schedule_work(&memcg->high_work);
@@ -4280,7 +4282,7 @@ void mem_cgroup_wb_stats(struct bdi_writeback *wb, unsigned long *pfilepages,while ((parent =parent_mem_cgroup (memcg))) {unsigned long ceiling =min (READ_ONCE (memcg->memory.max), -READ_ONCE (memcg->high)); +READ_ONCE (memcg->memory.high));unsigned long used =page_counter_read (&memcg->memory); *pheadroom =min (*pheadroom, ceiling -min (ceiling, used));
@@ -5005,7 +5007,7 @@ mem_cgroup_css_alloc(struct cgroup_subsys_state *parent_css)if (IS_ERR (memcg))return ERR_CAST (memcg); -WRITE_ONCE (memcg->high,PAGE_COUNTER_MAX ); +page_counter_set_high (&memcg->memory,PAGE_COUNTER_MAX ); memcg->soft_limit =PAGE_COUNTER_MAX ;if (parent) { memcg->swappiness =mem_cgroup_swappiness (parent);
@@ -5158,7 +5160,7 @@ static void mem_cgroup_css_reset(struct cgroup_subsys_state *css)page_counter_set_max (&memcg->tcpmem,PAGE_COUNTER_MAX );page_counter_set_min (&memcg->memory,0 );page_counter_set_low (&memcg->memory,0 ); -WRITE_ONCE (memcg->high,PAGE_COUNTER_MAX ); +page_counter_set_high (&memcg->memory,PAGE_COUNTER_MAX ); memcg->soft_limit =PAGE_COUNTER_MAX ;memcg_wb_domain_size_changed (memcg); }
@@ -5978,7 +5980,8 @@ static ssize_t memory_low_write(struct kernfs_open_file *of,static int memory_high_show (struct seq_file *m,void *v) { -return seq_puts_memcg_tunable (m,READ_ONCE (mem_cgroup_from_seq (m)->high)); +return seq_puts_memcg_tunable (m, +READ_ONCE (mem_cgroup_from_seq (m)->memory.high)); } static ssize_t memory_high_write(struct kernfs_open_file *of,
@@ -5995,7 +5998,7 @@ static ssize_t memory_high_write(struct kernfs_open_file *of,if (err)return err; -WRITE_ONCE (memcg->high, high); +page_counter_set_high (&memcg->memory, high);for (;;) {unsigned long nr_pages =page_counter_read (&memcg->memory);
Signature · 1 line
2.25.4
PATCH v6 4/4 mm: automatically penalize tasks with high swap use
In reply to Jakub KicinskiAdd a memory.swap.high knob, which can be used to protect the system from SWAP exhaustion. The mechanism used for penalizing is similar to memory.high penalty (sleep on return to user space).
That is not to say that the knob itself is equivalent to memory.high. The objective is more to protect the system from potentially buggy tasks consuming a lot of swap and impacting other tasks, or even bringing the whole system to stand still with complete SWAP exhaustion. Hopefully without the need to find per-task hard limits.
Slowing misbehaving tasks down gradually allows user space oom killers or other protection mechanisms to react. oomd and earlyoom already do killing based on swap exhaustion, and memory.swap.high protection will help implement such userspace oom policies more reliably.
We can use one counter for number of pages allocated under pressure to save struct task space and avoid two separate hierarchy walks on the hot path. The exact overage is calculated on return to user space, anyway.
Take the new high limit into account when determining if swap is "full". Borrowing the explanation from Johannes:
The idea behind "swap full" is that as long as the workload has plenty of swap space available and it's not changing its memory contents, it makes sense to generously hold on to copies of data in the swap device, even after the swapin. A later reclaim cycle can drop the page without any IO. Trading disk space for IO.
But the only two ways to reclaim a swap slot is when they're faulted in and the references go away, or by scanning the virtual address space like swapoff does - which is very expensive (one could argue it's too expensive even for swapoff, it's often more practical to just reboot).
So at some point in the fill level, we have to start freeing up swap slots on fault/swapin. Otherwise we could eventually run out of swap slots while they're filled with copies of data that is also in RAM.
We don't want to OOM a workload because its available swap space is filled with redundant cache.
--
v6:
- adjust commit message
- remove stale comments
- update comment in try_charge() to the text from Johannes
- remove use of page_counter_is_above_high()
v4:
- add a comment on using a single counter for both mem and swap pages
v3:
- count events for all groups over limit
- add doc for high events
- remove the magic scaling factor
- improve commit message
v2:
- add docs
- improve commit message
--- Documentation/admin-guide/cgroup-v2.rst | 20 ++++++ include/linux/memcontrol.h | 1 + mm/memcontrol.c | 88 +++++++++++++++++++++++-- 3 files changed, 102 insertions(+), 7 deletions(-)
Documentation/admin-guide/cgroup-v2.rst +20 -0
@@ -1373,6 +1373,22 @@ PAGE_SIZE multiple when read back. The total amount of swap currently being used by the cgroup and its descendants. + memory.swap.high + A read-write single value file which exists on non-root + cgroups. The default is "max". + + Swap usage throttle limit. If a cgroup's swap usage exceeds + this limit, all its further allocations will be throttled to + allow userspace to implement custom out-of-memory procedures. + + This limit marks a point of no return for the cgroup. It is NOT + designed to manage the amount of swapping a workload does + during regular operation. Compare to memory.swap.max, which + prohibits swapping past a set amount, but lets the cgroup + continue unimpeded as long as other memory can be reclaimed. + + Healthy workloads are not expected to reach this limit. + memory.swap.max A read-write single value file which exists on non-root cgroups. The default is "max".
@@ -1386,6 +1402,10 @@ PAGE_SIZE multiple when read back. otherwise, a value change in this file generates a file modified event. + high + The number of times the cgroup's swap usage was over + the high threshold. + max The number of times the cgroup's swap usage was about to go over the max boundary and swap allocation
include/linux/memcontrol.h +1 -0
@@ -42,6 +42,7 @@ enum memcg_memory_event {MEMCG_MAX ,MEMCG_OOM ,MEMCG_OOM_KILL , +MEMCG_SWAP_HIGH ,MEMCG_SWAP_MAX ,MEMCG_SWAP_FAIL , MEMCG_NR_MEMORY_EVENTS,
mm/memcontrol.c +81 -7
146 lines not on this page · raw message
Signature · 1 line
2.25.4
Re: [PATCH mm v6 4/4] mm: automatically penalize tasks with high swap use
Quoted 36 lines · Jakub Kicinski
Add a memory.swap.high knob, which can be used to protect the system from SWAP exhaustion. The mechanism used for penalizing is similar to memory.high penalty (sleep on return to user space).
That is not to say that the knob itself is equivalent to memory.high. The objective is more to protect the system from potentially buggy tasks consuming a lot of swap and impacting other tasks, or even bringing the whole system to stand still with complete SWAP exhaustion. Hopefully without the need to find per-task hard limits.
Slowing misbehaving tasks down gradually allows user space oom killers or other protection mechanisms to react. oomd and earlyoom already do killing based on swap exhaustion, and memory.swap.high protection will help implement such userspace oom policies more reliably.
We can use one counter for number of pages allocated under pressure to save struct task space and avoid two separate hierarchy walks on the hot path. The exact overage is calculated on return to user space, anyway.
Take the new high limit into account when determining if swap is "full". Borrowing the explanation from Johannes:
The idea behind "swap full" is that as long as the workload has plenty of swap space available and it's not changing its memory contents, it makes sense to generously hold on to copies of data in the swap device, even after the swapin. A later reclaim cycle can drop the page without any IO. Trading disk space for IO.
But the only two ways to reclaim a swap slot is when they're faulted in and the references go away, or by scanning the virtual address space like swapoff does - which is very expensive (one could argue it's too expensive even for swapoff, it's often more practical to just reboot).
Quoted 8 lines
So at some point in the fill level, we have to start freeing up swap slots on fault/swapin. Otherwise we could eventually run out of swap slots while they're filled with copies of data that is also in RAM.
We don't want to OOM a workload because its available swap space is filled with redundant cache.
Signed-off-by Jakub Kicinski <[email protected]>
This looks great to me now, thanks Jakub!
Michal Hocko
maintainerRe: [PATCH mm v6 4/4] mm: automatically penalize tasks with high swap use
In reply to Jakub KicinskiQuoted 36 lines · Jakub Kicinski
Add a memory.swap.high knob, which can be used to protect the system from SWAP exhaustion. The mechanism used for penalizing is similar to memory.high penalty (sleep on return to user space).
That is not to say that the knob itself is equivalent to memory.high. The objective is more to protect the system from potentially buggy tasks consuming a lot of swap and impacting other tasks, or even bringing the whole system to stand still with complete SWAP exhaustion. Hopefully without the need to find per-task hard limits.
Slowing misbehaving tasks down gradually allows user space oom killers or other protection mechanisms to react. oomd and earlyoom already do killing based on swap exhaustion, and memory.swap.high protection will help implement such userspace oom policies more reliably.
We can use one counter for number of pages allocated under pressure to save struct task space and avoid two separate hierarchy walks on the hot path. The exact overage is calculated on return to user space, anyway.
Take the new high limit into account when determining if swap is "full". Borrowing the explanation from Johannes:
The idea behind "swap full" is that as long as the workload has plenty of swap space available and it's not changing its memory contents, it makes sense to generously hold on to copies of data in the swap device, even after the swapin. A later reclaim cycle can drop the page without any IO. Trading disk space for IO.
But the only two ways to reclaim a swap slot is when they're faulted in and the references go away, or by scanning the virtual address space like swapoff does - which is very expensive (one could argue it's too expensive even for swapoff, it's often more practical to just reboot).
Quoted 8 lines
So at some point in the fill level, we have to start freeing up swap slots on fault/swapin. Otherwise we could eventually run out of swap slots while they're filled with copies of data that is also in RAM.
We don't want to OOM a workload because its available swap space is filled with redundant cache.
Signed-off-by Jakub Kicinski <[email protected]>
I am sorry for being late here but thanks for adding clarifications which make the semantic much more clear now! Also thanks for simplifying the throttling implementation. If a different scaling is needed then this can be added later on.
I do not see any other problems with the patch.
Thanks!
Signature · 2 lines
Michal Hocko SUSE Labs