autonuma: Optimize memory placement for memory tiering system
Subsystems (9)
cover autonuma: Optimize memory placement for memory tiering system
With the advent of various new memory types, some machines will have multiple types of memory, e.g. DRAM and PMEM (persistent memory). The memory subsystem of these machines can be called memory tiering system, because the performance of the different types of memory are usually different.
After commit c221c0b0308f ("device-dax: "Hotplug" persistent memory for use like normal RAM"), the PMEM could be used as the cost-effective volatile memory in separate NUMA nodes. In a typical memory tiering system, there are CPUs, DRAM and PMEM in each physical NUMA node. The CPUs and the DRAM will be put in one logical node, while the PMEM will be put in another (faked) logical node.
To optimize the system overall performance, the hot pages should be placed in DRAM node. To do that, we need to identify the hot pages in the PMEM node and migrate them to DRAM node via NUMA migration.
In the original AutoNUMA, there are already a set of existing mechanisms to identify the pages recently accessed by the CPUs in a node and migrate the pages to the node. So we can reuse these mechanisms to build the mechanisms to optimize the page placement in the memory tiering system. This has been implemented in this patchset.
At the other hand, the cold pages should be placed in PMEM node. So, we also need to identify the cold pages in the DRAM node and migrate them to PMEM node.
In the following patchset,
[RFC][PATCH 0/9] [v3] Migrate Pages in lieu of discard
https://lkml.kernel.org/lkml/[email protected]/
A mechanism to demote the cold DRAM pages to PMEM node under memory pressure is implemented. Based on that, the cold DRAM pages can be demoted to PMEM node proactively to free some memory space on DRAM node. And this frees the space on DRAM node for the hot PMEM pages to be promoted to. This has been implemented in this patchset too.
The patchset is based on the following not-yet-merged patchset,
[RFC][PATCH 0/9] [v3] Migrate Pages in lieu of discard
https://lkml.kernel.org/lkml/[email protected]/
This is part of a larger patch set. If you want to apply these or play with them, I'd suggest using the tree from below,
https://github.com/hying-caritas/linux/commits/autonuma-r3
We have tested the solution with the pmbench memory accessing benchmark with the 80:20 read/write ratio and the normal access address distribution on a 2 socket Intel server with Optane DC Persistent Memory Model. The test results of the base kernel and step by step optimizations are as follows,
Throughput Promotion DRAM bandwidth
access/s MB/s MB/s
----------- ---------- --------------
Base 63868367.1 3626.7 Patch 1 137611105.1 353.5 8608.5 Patch 2 136124113.3 351.8 8480.7 Patch 3 160166665.7 208.2 9407.8 Patch 4 158461356.4 105.3 8790.0 Patch 5 163254205.3 73.6 8800.2
The whole patchset improves the benchmark score up to 155.6%. The basic AutoNUMA based optimization solution, the hot page selection algorithm, and the threshold automatic adjustment algorithms improves the performance or reduce the overhead (promotion MB/s) mostly.
Changelog:
v3:
- Move the rate limit control as late as possible per Mel Gorman's comments.
- Revise the hot page selection implementation to store page scan time in struct page.
- Code cleanup.
- Rebased on the latest page demotion patchset.
v2:
- Addressed comments for V1.
- Rebased on v5.5.
Best Regards,
Huang, Ying
RFC 1/5 autonuma: Optimize page placement for memory tiering system
With the advent of various new memory types, some machines will have multiple types of memory, e.g. DRAM and PMEM (persistent memory). The memory subsystem of these machines can be called memory tiering system, because the performance of the different types of memory are usually different.
In such system, because of the memory accessing pattern changing etc, some pages in the slow memory may become hot globally. So in this patch, the AutoNUMA mechanism is enhanced to optimize the page placement among the different memory types according to hot/cold dynamically.
In a typical memory tiering system, there are CPUs, fast memory and slow memory in each physical NUMA node. The CPUs and the fast memory will be put in one logical node (called fast memory node), while the slow memory will be put in another (faked) logical node (called slow memory node). That is, the fast memory is regarded as local while the slow memory is regarded as remote. So it's possible for the recently accessed pages in the slow memory node to be promoted to the fast memory node via the existing AutoNUMA mechanism.
The original AutoNUMA mechanism will stop to migrate pages if the free memory of the target node will become below the high watermark. This is a reasonable policy if there's only one memory type. But this makes the original AutoNUMA mechanism almost not work to optimize page placement among different memory types. Details are as follows.
It's the common cases that the working-set size of the workload is larger than the size of the fast memory nodes. Otherwise, it's unnecessary to use the slow memory at all. So in the common cases, there are almost always no enough free pages in the fast memory nodes, so that the globally hot pages in the slow memory node cannot be promoted to the fast memory node. To solve the issue, we have 2 choices as follows,
a. Ignore the free pages watermark checking when promoting hot pages
from the slow memory node to the fast memory node. This will create some memory pressure in the fast memory node, thus trigger the memory reclaiming. So that, the cold pages in the fast memory node will be demoted to the slow memory node.
b. Make kswapd of the fast memory node to reclaim pages until the free
pages are a little more (about 10MB) than the high watermark. Then, if the free pages of the fast memory node reaches high watermark, and some hot pages need to be promoted, kswapd of the fast memory node will be waken up to demote some cold pages in the fast memory node to the slow memory node. This will free some extra space in the fast memory node, so the hot pages in the slow memory node can be promoted to the fast memory node.
The choice "a" will create the memory pressure in the fast memory node. If the memory pressure of the workload is high, the memory pressure may become so high that the memory allocation latency of the workload is influenced, e.g. the direct reclaiming may be triggered.
The choice "b" works much better at this aspect. If the memory pressure of the workload is high, the hot pages promotion will stop earlier because its allocation watermark is higher than that of the normal memory allocation. So in this patch, choice "b" is implemented.
In addition to the original page placement optimization among sockets, the AutoNUMA mechanism is extended to be used to optimize page placement according to hot/cold among different memory types. So the sysctl user space interface (numa_balancing) is extended in a backward compatible way as follow, so that the users can enable/disable these functionality individually.
The sysctl is converted from a Boolean value to a bits field. The definition of the flags is,
- 0x0: NUMA_BALANCING_DISABLED
- 0x1: NUMA_BALANCING_NORMAL
- 0x2: NUMA_BALANCING_MEMORY_TIERING
TODO:
- Update ABI document: Documentation/sysctl/kernel.txt
--- include/linux/sched/sysctl.h | 5 +++++ kernel/sched/core.c | 9 +++------ kernel/sysctl.c | 7 ++++--- mm/migrate.c | 30 +++++++++++++++++++++++++++--- mm/vmscan.c | 15 +++++++++++++++ 5 files changed, 54 insertions(+), 12 deletions(-)
include/linux/sched/sysctl.h +5 -0
@@ -39,6 +39,11 @@ enum sched_tunable_scaling { };extern enum sched_tunable_scaling sysctl_sched_tunable_scaling; +#define NUMA_BALANCING_DISABLED 0x0 +#define NUMA_BALANCING_NORMAL 0x1 +#define NUMA_BALANCING_MEMORY_TIERING 0x2 + +extern int sysctl_numa_balancing_mode;extern unsigned int sysctl_numa_balancing_scan_delay;extern unsigned int sysctl_numa_balancing_scan_period_min;extern unsigned int sysctl_numa_balancing_scan_period_max;
kernel/sched/core.c +3 -6
@@ -2794,6 +2794,7 @@ static void __sched_fork(unsigned long clone_flags, struct task_struct *p) }DEFINE_STATIC_KEY_FALSE (sched_numa_balancing); +int sysctl_numa_balancing_mode;#ifdef CONFIG_NUMA_BALANCING
@@ -2809,20 +2810,16 @@ void set_numabalancing_state(bool enabled)int sysctl_numa_balancing (struct ctl_table *table,int write,void *buffer,size_t *lenp,loff_t *ppos) { -struct ctl_table t;int err; -int state =static_branch_likely (&sched_numa_balancing);if (write && !capable (CAP_SYS_ADMIN ))return -EPERM ; - t = *table; - t.data = &state; - err =proc_dointvec_minmax (&t, write, buffer, lenp, ppos); + err =proc_dointvec_minmax (table, write, buffer, lenp, ppos);if (err <0 )return err;if (write) -set_numabalancing_state (state); +set_numabalancing_state (*(int *)table->data);return err; }#endif
kernel/sysctl.c +4 -3
@@ -113,6 +113,7 @@ static int sixty = 60;static int __maybe_unused neg_one =-1 ;static int __maybe_unused two =2 ; +static int __maybe_unused three =3 ;static int __maybe_unused four =4 ;static unsigned long zero_ul;static unsigned long one_ul =1 ;
@@ -1756,12 +1757,12 @@ static struct ctl_table kern_table[] = { }, { .procname = "numa_balancing", - .data = NULL, /* filled in by handler */ - .maxlen = sizeof(unsigned int), + .data = &sysctl_numa_balancing_mode, + .maxlen = sizeof(int), .mode = 0644, .proc_handler = sysctl_numa_balancing, .extra1 = SYSCTL_ZERO, - .extra2 = SYSCTL_ONE, + .extra2 = &three, },#endif /* CONFIG_NUMA_BALANCING */ #endif /* CONFIG_SCHED_DEBUG */
mm/migrate.c +27 -3
@@ -50,6 +50,7 @@#include <linux/ptrace.h> #include <linux/oom.h> #include <linux/memory.h> +#include <linux/sched/sysctl.h> #include <asm/tlbflush.h>
@@ -1954,13 +1955,36 @@ static struct page *alloc_misplaced_dst_page(struct page *page,static int numamigrate_isolate_page (pg_data_t *pgdat,struct page *page) { -int page_lru; +int page_lru, nr =compound_nr (page), order =compound_order (page); -VM_BUG_ON_PAGE (compound_order (page) && !PageTransHuge (page), page); +VM_BUG_ON_PAGE (order && !PageTransHuge (page), page);/* Avoid migrating to a node that is nearly full */ -if (!migrate_balanced_pgdat (pgdat,compound_nr (page))) +if (!migrate_balanced_pgdat (pgdat, nr)) { +int migration_node, z; +pg_data_t *migration_pgdat; + +if (!(sysctl_numa_balancing_mode &NUMA_BALANCING_MEMORY_TIERING ) || + !(node_reclaim_mode &RECLAIM_MIGRATE )) +return 0 ; +/* +* The slow memory node need to have enough +* free pages to demote the cold pages in the +* fast memory node to it. +*/ + migration_node =next_demotion_node (pgdat->node_id); +if (migration_node ==NUMA_NO_NODE ) +return 0 ; + migration_pgdat =NODE_DATA (migration_node); +if (!migrate_balanced_pgdat (migration_pgdat, nr)) +return 0 ; +for (z = pgdat->nr_zones -1 ; z >=0 ; z--) { +if (populated_zone (pgdat->node_zones + z)) +break ; + } +wakeup_kswapd (pgdat->node_zones + z,0 , order,ZONE_MOVABLE );return 0 ; + }if (isolate_lru_page (page))return 0 ;
mm/vmscan.c +15 -0
@@ -58,6 +58,7 @@#include <linux/swapops.h> #include <linux/balloon_compaction.h> +#include <linux/sched/sysctl.h> #include "internal.h"
@@ -3544,6 +3545,12 @@ static bool pgdat_watermark_boosted(pg_data_t *pgdat, int highest_zoneidx)return false; } +/* +* Keep the free pages on fast memory node a little more than the high +* watermark to accommodate the promoted pages. +*/ +#define NUMA_BALANCING_ADDON_WATERMARK (10UL * 1024 * 1024 >> PAGE_SHIFT) +/* * Returns true if there is an eligible zone balanced for the request order * and highest_zoneidx
@@ -3565,6 +3572,14 @@ static bool pgdat_balanced(pg_data_t *pgdat, int order, int highest_zoneidx)continue ; mark =high_wmark_pages (zone); +if (sysctl_numa_balancing_mode &NUMA_BALANCING_MEMORY_TIERING && +next_demotion_node (pgdat->node_id) !=NUMA_NO_NODE ) { +unsigned long addon_mark; + + addon_mark =min (NUMA_BALANCING_ADDON_WATERMARK , + pgdat->node_present_pages >>6 ); + mark += addon_mark; + }if (zone_watermark_ok_safe (zone, order, mark, highest_zoneidx))return true; }
Signature · 1 line
2.27.0
RFC 2/5 autonuma, memory tiering: Skip to scan fast memory
In reply to Huang YingIf the AutoNUMA isn't used to optimize the page placement among sockets but only among memory types, the hot pages in the fast memory node couldn't be migrated (promoted) to anywhere. So it's unnecessary to scan the pages in the fast memory node via changing their PTE/PMD mapping to be PROT_NONE. So that the page faults could be avoided too.
In the test, if only the memory tiering AutoNUMA mode is enabled, the number of the AutoNUMA hint faults for the DRAM node is reduced to almost 0 with the patch. While the benchmark score doesn't change visibly.
--- include/linux/node.h | 5 +++++ mm/huge_memory.c | 30 +++++++++++++++++++++--------- mm/mprotect.c | 13 ++++++++++++- 3 files changed, 38 insertions(+), 10 deletions(-)
include/linux/node.h +5 -0
@@ -189,4 +189,9 @@ static inline int next_demotion_node(int node) }#endif +static inline bool node_is_toptier (int node) +{ +return node_state (node,N_CPU ); +} +#endif /* _LINUX_NODE_H_ */
mm/huge_memory.c +21 -9
@@ -33,6 +33,7 @@#include <linux/oom.h> #include <linux/numa.h> #include <linux/page_owner.h> +#include <linux/sched/sysctl.h> #include <asm/tlb.h> #include <asm/pgalloc.h>
@@ -1821,17 +1822,28 @@ int change_huge_pmd(struct vm_area_struct *vma, pmd_t *pmd, }#endif -/* -* Avoid trapping faults against the zero page. The read-only -* data is likely to be read-cached on the local CPU and -* local/remote hits to the zero page are not interesting. -*/ -if (prot_numa &&is_huge_zero_pmd (*pmd)) - goto unlock; +if (prot_numa) { +struct page *page; +/* +* Avoid trapping faults against the zero page. The read-only +* data is likely to be read-cached on the local CPU and +* local/remote hits to the zero page are not interesting. +*/ +if (is_huge_zero_pmd (*pmd)) + goto unlock; -if (prot_numa &&pmd_protnone (*pmd)) - goto unlock; +if (pmd_protnone (*pmd)) + goto unlock; + page =pmd_page (*pmd); +/* +* Skip scanning top tier node if normal numa +* balancing is disabled +*/ +if (!(sysctl_numa_balancing_mode &NUMA_BALANCING_NORMAL ) && +node_is_toptier (page_to_nid (page))) + goto unlock; + }/* * In case prot_numa, we are under mmap_read_lock(mm). It's critical * to not clear pmd intermittently to avoid race with MADV_DONTNEED
mm/mprotect.c +12 -1
@@ -29,6 +29,7 @@#include <linux/uaccess.h> #include <linux/mm_inline.h> #include <linux/pgtable.h> +#include <linux/sched/sysctl.h> #include <asm/cacheflush.h> #include <asm/mmu_context.h> #include <asm/tlbflush.h>
@@ -83,6 +84,7 @@ static unsigned long change_pte_range(struct vm_area_struct *vma, pmd_t *pmd,*/ if (prot_numa) {struct page *page; +int nid;/* Avoid TLB flush if possible */ if (pte_protnone (oldpte))
@@ -109,7 +111,16 @@ static unsigned long change_pte_range(struct vm_area_struct *vma, pmd_t *pmd,* Don't mess with PTEs if page is already on the node * a single-threaded process is running on. */ -if (target_node ==page_to_nid (page)) + nid =page_to_nid (page); +if (target_node == nid) +continue ; + +/* +* Skip scanning top tier node if normal numa +* balancing is disabled +*/ +if (!(sysctl_numa_balancing_mode &NUMA_BALANCING_NORMAL ) && +node_is_toptier (nid))continue ; }
Signature · 1 line
2.27.0
RFC 3/5 autonuma, memory tiering: Hot page selection with hint page fault latency
In reply to Huang YingTo optimize page placement in a memory tiering system with AutoNUMA, the hot pages in the slow memory node need to be identified. Essentially, the original AutoNUMA implementation selects the mostly recently accessed (MRU) pages as the hot pages. But this isn't a very good algorithm to identify the hot pages.
So, in this patch we implemented a better hot page selection algorithm. Which is based on AutoNUMA page table scanning and hint page fault as follows,
- When the page tables of the processes are scanned to change PTE/PMD to be PROT_NONE, the current time is recorded in struct page as scan time.
- When the page is accessed, hint page fault will occur. The scan time is gotten from the struct page. And The hint page fault latency is defined as
hint page fault time - scan time
The shorter the hint page fault latency of a page is, the higher the probability of their access frequency to be higher. So the hint page fault latency is a good estimation of the page hot/cold.
But it's hard to find some extra space in struct page to hold the scan time. Fortunately, we can reuse some bits used by the original AutoNUMA.
AutoNUMA uses some bits in struct page to store the page accessing CPU and PID (referring to page_cpupid_xchg_last()). Which is used by the multi-stage node selection algorithm to avoid to migrate pages shared accessed by the NUMA nodes back and forth. But for pages in the slow memory node, even if they are shared accessed by multiple NUMA nodes, as long as the pages are hot, they need to be promoted to the fast memory node. So the accessing CPU and PID information are unnecessary for the slow memory pages. We can reuse these bits in struct page to record the scan time for them. For the fast memory pages, these bits are used as before.
The remaining problem is how to determine the hot threshold. It's not easy to be done automatically. So we provide a sysctl knob:
kernel.numa_balancing_hot_threshold_ms. All pages with hint page fault latency < the threshold will be considered hot. The system administrator can determine the hot threshold via various information, such as PMEM bandwidth limit, the average number of the pages pass the hot threshold, etc. The default hot threshold is 1 second, which works well in our performance test.
The patch improves the score of pmbench memory accessing benchmark with 80:20 read/write ratio and normal access address distribution by 16.8% with 41.1% less pages promoted (that is, less overhead) on a 2 socket Intel server with Optance DC Persistent Memory.
The downside of the patch is that the response time to the workload hot spot changing may be much longer. For example,
- A previous cold memory area becomes hot
- The hint page fault will be triggered. But the hint page fault latency isn't shorter than the hot threshold. So the pages will not be promoted.
- When the memory area is scanned again, maybe after a scan period, the hint page fault latency measured will be shorter than the hot threshold and the pages will be promoted.
To mitigate this,
- If there are enough free space in the fast memory node, the hot threshold will not be used, all pages will be promoted upon the hint page fault for fast response.
- If fast response is more important for system performance, the administrator can set a higher hot threshold.
--- include/linux/mm.h | 29 ++++++++++++++++ include/linux/sched/sysctl.h | 1 + kernel/sched/fair.c | 67 ++++++++++++++++++++++++++++++++++++ kernel/sysctl.c | 7 ++++ mm/huge_memory.c | 13 +++++-- mm/memory.c | 11 +++++- mm/migrate.c | 12 +++++++ mm/mmzone.c | 17 +++++++++ mm/mprotect.c | 8 ++++- 9 files changed, 160 insertions(+), 5 deletions(-)
include/linux/mm.h +29 -0
@@ -1278,6 +1278,18 @@ static inline int page_to_nid(const struct page *page)#endif #ifdef CONFIG_NUMA_BALANCING +/* page access time bits needs to hold at least 4 seconds */ +#define PAGE_ACCESS_TIME_MIN_BITS 12 +#if LAST_CPUPID_SHIFT <PAGE_ACCESS_TIME_MIN_BITS +#define PAGE_ACCESS_TIME_BUCKETS \ + (PAGE_ACCESS_TIME_MIN_BITS - LAST_CPUPID_SHIFT) +#else +#define PAGE_ACCESS_TIME_BUCKETS 0 +#endif + +#define PAGE_ACCESS_TIME_MASK \ + (LAST_CPUPID_MASK << PAGE_ACCESS_TIME_BUCKETS) +static inline int cpu_pid_to_cpupid (int cpu,int pid) {return ((cpu &LAST__CPU_MASK ) <<LAST__PID_SHIFT ) | (pid &LAST__PID_MASK );
@@ -1320,6 +1332,16 @@ static inline int page_cpupid_xchg_last(struct page *page, int cpupid)return xchg (&page->_last_cpupid, cpupid &LAST_CPUPID_MASK ); } +static inline unsigned int xchg_page_access_time (struct page *page, +unsigned int time) +{ +unsigned int last_time; + + last_time =xchg (&page->_last_cpupid, + (time >>PAGE_ACCESS_TIME_BUCKETS ) &LAST_CPUPID_MASK ); +return last_time <<PAGE_ACCESS_TIME_BUCKETS ; +} +static inline int page_cpupid_last (struct page *page) {return page->_last_cpupid;
@@ -1335,6 +1357,7 @@ static inline int page_cpupid_last(struct page *page) }extern int page_cpupid_xchg_last (struct page *page,int cpupid); +extern unsigned int xchg_page_access_time (struct page *page,unsigned int time);static inline void page_cpupid_reset_last (struct page *page) {
@@ -1347,6 +1370,12 @@ static inline int page_cpupid_xchg_last(struct page *page, int cpupid)return page_to_nid (page);/* XXX */ } +static inline unsigned int xchg_page_access_time (struct page *page, +unsigned int time) +{ +return 0 ; +} +static inline int page_cpupid_last (struct page *page) {return page_to_nid (page);/* XXX */
include/linux/sched/sysctl.h +1 -0
@@ -48,6 +48,7 @@ extern unsigned int sysctl_numa_balancing_scan_delay;extern unsigned int sysctl_numa_balancing_scan_period_min;extern unsigned int sysctl_numa_balancing_scan_period_max;extern unsigned int sysctl_numa_balancing_scan_size; +extern unsigned int sysctl_numa_balancing_hot_threshold;#ifdef CONFIG_SCHED_DEBUG extern __read_mostly unsigned int sysctl_sched_migration_cost;
kernel/sched/fair.c +67 -0
97 lines not on this page · raw message
kernel/sysctl.c +7 -0
@@ -1755,6 +1755,13 @@ static struct ctl_table kern_table[] = { .proc_handler = proc_dointvec_minmax, .extra1 = SYSCTL_ONE, }, + { + .procname = "numa_balancing_hot_threshold_ms", + .data = &sysctl_numa_balancing_hot_threshold, + .maxlen = sizeof(unsigned int), + .mode = 0644, + .proc_handler = proc_dointvec, + }, { .procname = "numa_balancing", .data = &sysctl_numa_balancing_mode,
mm/huge_memory.c +10 -3
@@ -1399,7 +1399,7 @@ vm_fault_t do_huge_pmd_numa_page(struct vm_fault *vmf, pmd_t pmd)struct page *page;unsigned long haddr = vmf->address &HPAGE_PMD_MASK ;int page_nid =NUMA_NO_NODE , this_nid =numa_node_id (); -int target_nid, last_cpupid =-1 ; +int target_nid, last_cpupid = (-1 &LAST_CPUPID_MASK );bool page_locked;bool migrated = false;bool was_writable;
@@ -1426,7 +1426,8 @@ vm_fault_t do_huge_pmd_numa_page(struct vm_fault *vmf, pmd_t pmd) page =pmd_page (pmd);BUG_ON (is_huge_zero_page (page)); page_nid =page_to_nid (page); - last_cpupid =page_cpupid_last (page); +if (node_is_toptier (page_nid)) + last_cpupid =page_cpupid_last (page);count_vm_numa_event (NUMA_HINT_FAULTS );if (page_nid == this_nid) {count_vm_numa_event (NUMA_HINT_FAULTS_LOCAL );
@@ -1824,6 +1825,7 @@ int change_huge_pmd(struct vm_area_struct *vma, pmd_t *pmd,if (prot_numa) {struct page *page; +bool toptier;/* * Avoid trapping faults against the zero page. The read-only * data is likely to be read-cached on the local CPU and
@@ -1836,13 +1838,18 @@ int change_huge_pmd(struct vm_area_struct *vma, pmd_t *pmd, goto unlock; page =pmd_page (*pmd); + toptier =node_is_toptier (page_to_nid (page));/* * Skip scanning top tier node if normal numa * balancing is disabled */ if (!(sysctl_numa_balancing_mode &NUMA_BALANCING_NORMAL ) && -node_is_toptier (page_to_nid (page))) + toptier) goto unlock; + +if (sysctl_numa_balancing_mode &NUMA_BALANCING_MEMORY_TIERING && + !toptier) +xchg_page_access_time (page,jiffies_to_msecs (jiffies)); }/* * In case prot_numa, we are under mmap_read_lock(mm). It's critical
mm/memory.c +10 -1
@@ -71,6 +71,7 @@#include <linux/dax.h> #include <linux/oom.h> #include <linux/numa.h> +#include <linux/sched/sysctl.h> #include <trace/events/kmem.h>
@@ -4077,8 +4078,16 @@ static vm_fault_t do_numa_page(struct vm_fault *vmf)if (page_mapcount (page) >1 && (vma->vm_flags &VM_SHARED )) flags |=TNF_SHARED ; - last_cpupid =page_cpupid_last (page); page_nid =page_to_nid (page); +/* +* In memory tiering mode, cpupid of slow memory page is used +* to record page access time. So use default value. +*/ +if ((sysctl_numa_balancing_mode &NUMA_BALANCING_MEMORY_TIERING ) && + !node_is_toptier (page_nid)) + last_cpupid = (-1 &LAST_CPUPID_MASK ); +else + last_cpupid =page_cpupid_last (page); target_nid =numa_migrate_prep (page, vma, vmf->address, page_nid, &flags);pte_unmap_unlock (vmf->pte, vmf->ptl);
mm/migrate.c +12 -0
@@ -641,6 +641,18 @@ void migrate_page_states(struct page *newpage, struct page *page)* future migrations of this same page. */ cpupid =page_cpupid_xchg_last (page,-1 ); +/* +* If migrate between slow and fast memory node, reset cpupid, +* because that is used to record page access time in slow +* memory node +*/ +if (sysctl_numa_balancing_mode &NUMA_BALANCING_MEMORY_TIERING ) { +bool f_toptier =node_is_toptier (page_to_nid (page)); +bool t_toptier =node_is_toptier (page_to_nid (newpage)); + +if (f_toptier != t_toptier) + cpupid =-1 ; + }page_cpupid_xchg_last (newpage, cpupid);ksm_migrate_page (newpage, page);
mm/mmzone.c +17 -0
@@ -112,4 +112,21 @@ int page_cpupid_xchg_last(struct page *page, int cpupid) return last_cpupid; } + +unsigned int xchg_page_access_time (struct page *page,unsigned int time) +{ +unsigned long old_flags, flags; +unsigned int last_time; + + time >>=PAGE_ACCESS_TIME_BUCKETS ; +do { + old_flags = flags = page->flags; + last_time = (flags >>LAST_CPUPID_PGSHIFT ) &LAST_CPUPID_MASK ; + + flags &= ~(LAST_CPUPID_MASK <<LAST_CPUPID_PGSHIFT ); + flags |= (time &LAST_CPUPID_MASK ) <<LAST_CPUPID_PGSHIFT ; + }while (unlikely (cmpxchg (&page->flags, old_flags, flags) != old_flags)); + +return last_time <<PAGE_ACCESS_TIME_BUCKETS ; +}#endif
mm/mprotect.c +7 -1
@@ -85,6 +85,7 @@ static unsigned long change_pte_range(struct vm_area_struct *vma, pmd_t *pmd,if (prot_numa) {struct page *page;int nid; +bool toptier;/* Avoid TLB flush if possible */ if (pte_protnone (oldpte))
@@ -114,14 +115,19 @@ static unsigned long change_pte_range(struct vm_area_struct *vma, pmd_t *pmd, nid =page_to_nid (page);if (target_node == nid)continue ; + toptier =node_is_toptier (nid);/* * Skip scanning top tier node if normal numa * balancing is disabled */ if (!(sysctl_numa_balancing_mode &NUMA_BALANCING_NORMAL ) && -node_is_toptier (nid)) + toptier)continue ; +if (sysctl_numa_balancing_mode &NUMA_BALANCING_MEMORY_TIERING && + !toptier) +xchg_page_access_time (page, +jiffies_to_msecs (jiffies)); } oldpte =ptep_modify_prot_start (vma, addr, pte);
Signature · 1 line
2.27.0
RFC 4/5 autonuma, memory tiering: Rate limit NUMA migration throughput
In reply to Huang YingIn AutoNUMA memory tiering mode, the hot slow memory pages could be promoted to the fast memory node via AutoNUMA. But this incurs some overhead too. So that sometimes the workload performance may be hurt. To avoid too much disturbing to the workload in these situations, we should make it possible to rate limit the promotion throughput.
So, in this patch, we implement a simple rate limit algorithm as follows. The number of the candidate pages to be promoted to the fast memory node via AutoNUMA is counted, if the count exceeds the limit specified by the users, the AutoNUMA promotion will be stopped until the next second.
Test the patch with the pmbench memory accessing benchmark with 80:20 read/write ratio and normal access address distribution on a 2 socket Intel server with Optane DC Persistent Memory Model. In the test, the page promotion throughput decreases 49.4% (from 208.2 MB/s to 105.3 MB/s) with the patch, while the benchmark score decreases only 1.1%.
A new sysctl knob kernel.numa_balancing_rate_limit_mbps is added for the users to specify the limit.
TODO: Add ABI document for new sysctl knob.
--- include/linux/mmzone.h | 7 +++++++ include/linux/sched/sysctl.h | 6 ++++++ kernel/sched/fair.c | 29 +++++++++++++++++++++++++++-- kernel/sysctl.c | 8 ++++++++ mm/vmstat.c | 3 +++ 5 files changed, 51 insertions(+), 2 deletions(-)
include/linux/mmzone.h +7 -0
@@ -203,6 +203,9 @@ enum node_stat_item {NR_KERNEL_MISC_RECLAIMABLE ,/* reclaimable non-slab kernel pages */ NR_FOLL_PIN_ACQUIRED ,/* via: pin_user_page(), gup flag: FOLL_PIN */ NR_FOLL_PIN_RELEASED ,/* pages returned via unpin_user_page() */ +#ifdef CONFIG_NUMA_BALANCING +NUMA_NR_CANDIDATE ,/* candidate pages to migrate */ +#endif NR_VM_NODE_STAT_ITEMS };
@@ -746,6 +749,10 @@ typedef struct pglist_data {struct deferred_split deferred_split_queue;#endif +#ifdef CONFIG_NUMA_BALANCING +unsigned long numa_ts; +unsigned long numa_nr_candidate; +#endif /* Fields commonly accessed by the page reclaim scanner */ /*
include/linux/sched/sysctl.h +6 -0
@@ -50,6 +50,12 @@ extern unsigned int sysctl_numa_balancing_scan_period_max;extern unsigned int sysctl_numa_balancing_scan_size;extern unsigned int sysctl_numa_balancing_hot_threshold; +#ifdef CONFIG_NUMA_BALANCING +extern unsigned int sysctl_numa_balancing_rate_limit; +#else +#define sysctl_numa_balancing_rate_limit 0 +#endif +#ifdef CONFIG_SCHED_DEBUG extern __read_mostly unsigned int sysctl_sched_migration_cost;extern __read_mostly unsigned int sysctl_sched_nr_migrate;
kernel/sched/fair.c +27 -2
@@ -1078,6 +1078,11 @@ unsigned int sysctl_numa_balancing_scan_delay = 1000;/* The page with hint page fault latency < threshold in ms is considered hot */ unsigned int sysctl_numa_balancing_hot_threshold =1000 ; +/* +* Restrict the NUMA migration per second in MB for each target node +* if no enough free space in target node +*/ +unsigned int sysctl_numa_balancing_rate_limit =65536 ;struct numa_group {refcount_t refcount;
@@ -1450,6 +1455,23 @@ static int numa_hint_fault_latency(struct page *page)return (time - last_time) &PAGE_ACCESS_TIME_MASK ; } +static bool numa_migration_check_rate_limit (struct pglist_data *pgdat, +unsigned long rate_limit,int nr) +{ +unsigned long nr_candidate; +unsigned long now = jiffies, last_ts; + +mod_node_page_state (pgdat,NUMA_NR_CANDIDATE , nr); + nr_candidate =node_page_state (pgdat,NUMA_NR_CANDIDATE ); + last_ts = pgdat->numa_ts; +if (now > last_ts +HZ && +cmpxchg (&pgdat->numa_ts, last_ts, now) == last_ts) + pgdat->numa_nr_candidate = nr_candidate; +if (nr_candidate - pgdat->numa_nr_candidate > rate_limit) +return false; +return true; +} +bool should_numa_migrate_memory (struct task_struct *p,struct page * page,int src_nid,int dst_cpu) {
@@ -1464,7 +1486,7 @@ bool should_numa_migrate_memory(struct task_struct *p, struct page * page,if (sysctl_numa_balancing_mode &NUMA_BALANCING_MEMORY_TIERING && !node_is_toptier (src_nid)) {struct pglist_data *pgdat; -unsigned long latency, th; +unsigned long rate_limit, latency, th; pgdat =NODE_DATA (dst_nid);if (pgdat_free_space_enough (pgdat))
@@ -1475,7 +1497,10 @@ bool should_numa_migrate_memory(struct task_struct *p, struct page * page,if (latency > th)return false; -return true; + rate_limit = + sysctl_numa_balancing_rate_limit << (20 -PAGE_SHIFT ); +return numa_migration_check_rate_limit (pgdat, rate_limit, +hpage_nr_pages (page)); } this_cpupid =cpu_pid_to_cpupid (dst_cpu, current->pid);
kernel/sysctl.c +8 -0
@@ -1762,6 +1762,14 @@ static struct ctl_table kern_table[] = { .mode = 0644, .proc_handler = proc_dointvec, }, + { + .procname = "numa_balancing_rate_limit_mbps", + .data = &sysctl_numa_balancing_rate_limit, + .maxlen = sizeof(unsigned int), + .mode = 0644, + .proc_handler = proc_dointvec_minmax, + .extra1 = SYSCTL_ZERO, + }, { .procname = "numa_balancing", .data = &sysctl_numa_balancing_mode,
mm/vmstat.c +3 -0
@@ -1172,6 +1172,9 @@ const char * const vmstat_text[] = {"nr_kernel_misc_reclaimable" ,"nr_foll_pin_acquired" ,"nr_foll_pin_released" , +#ifdef CONFIG_NUMA_BALANCING +"numa_nr_candidate" , +#endif/* enum writeback_stat_item counters */ "nr_dirty_threshold",
Signature · 1 line
2.27.0
RFC 5/5 autonuma, memory tiering: Adjust hot threshold automatically
In reply to Huang YingIt isn't easy for the administrator to determine the hot threshold. So in this patch, a method to adjust the hot threshold automatically is implemented. The basic idea is to control the number of the candidate promotion pages to match the promotion rate limit. If the hint page fault latency of a page is less than the hot threshold, we will try to promote the page, and the page is called the candidate promotion page.
If the number of the candidate promotion pages in the statistics interval is much more than the promotion rate limit, the hot threshold will be decreased to reduce the number of the candidate promotion pages. Otherwise, the hot threshold will be increased to increase the number of the candidate promotion pages.
To make the above method works, in each statistics interval, the total number of the pages to check (on which the hint page faults occur) and the hot/cold distribution need to be stable. Because the page tables are scanned linearly in AutoNUMA, but the hot/cold distribution isn't uniform along the address, the statistics interval should be larger than the AutoNUMA scan period. So in the patch, the max scan period is used as statistics interval and it works well in our tests.
The sysctl knob kernel.numa_balancing_hot_threshold_ms becomes the initial value and max value of the hot threshold.
The patch improves the score of pmbench memory accessing benchmark with 80:20 read/write ratio and normal access address distribution by 3% with 30% fewer NUMA page migrations on a 2 socket Intel server with Optance DC Persistent Memory. Because it improves the accuracy of the hot page selection.
--- include/linux/mmzone.h | 3 +++ kernel/sched/fair.c | 40 ++++++++++++++++++++++++++++++++++++---- 2 files changed, 39 insertions(+), 4 deletions(-)
include/linux/mmzone.h +3 -0
@@ -752,6 +752,9 @@ typedef struct pglist_data {#ifdef CONFIG_NUMA_BALANCING unsigned long numa_ts;unsigned long numa_nr_candidate; +unsigned long numa_threshold_ts; +unsigned long numa_threshold_nr_candidate; +unsigned long numa_threshold;#endif /* Fields commonly accessed by the page reclaim scanner */
kernel/sched/fair.c +36 -4
@@ -1472,6 +1472,35 @@ static bool numa_migration_check_rate_limit(struct pglist_data *pgdat,return true; } +#define NUMA_MIGRATION_ADJUST_STEPS 16 + +static void numa_migration_adjust_threshold (struct pglist_data *pgdat, +unsigned long rate_limit, +unsigned long ref_th) +{ +unsigned long now = jiffies, last_th_ts, th_period; +unsigned long unit_th, th; +unsigned long nr_cand, ref_cand, diff_cand; + + th_period =msecs_to_jiffies (sysctl_numa_balancing_scan_period_max); + last_th_ts = pgdat->numa_threshold_ts; +if (now > last_th_ts + th_period && +cmpxchg (&pgdat->numa_threshold_ts, last_th_ts, now) == last_th_ts) { + ref_cand = rate_limit * + sysctl_numa_balancing_scan_period_max /1000 ; + nr_cand =node_page_state (pgdat,NUMA_NR_CANDIDATE ); + diff_cand = nr_cand - pgdat->numa_threshold_nr_candidate; + unit_th = ref_th /NUMA_MIGRATION_ADJUST_STEPS ; + th = pgdat->numa_threshold ? : ref_th; +if (diff_cand > ref_cand *11 /10 ) + th =max (th - unit_th, unit_th); +else if (diff_cand < ref_cand *9 /10 ) + th =min (th + unit_th, ref_th); + pgdat->numa_threshold_nr_candidate = nr_cand; + pgdat->numa_threshold = th; + } +} +bool should_numa_migrate_memory (struct task_struct *p,struct page * page,int src_nid,int dst_cpu) {
@@ -1486,19 +1515,22 @@ bool should_numa_migrate_memory(struct task_struct *p, struct page * page,if (sysctl_numa_balancing_mode &NUMA_BALANCING_MEMORY_TIERING && !node_is_toptier (src_nid)) {struct pglist_data *pgdat; -unsigned long rate_limit, latency, th; +unsigned long rate_limit, latency, th, def_th; pgdat =NODE_DATA (dst_nid);if (pgdat_free_space_enough (pgdat))return true; - th = sysctl_numa_balancing_hot_threshold; + def_th = sysctl_numa_balancing_hot_threshold; + rate_limit = + sysctl_numa_balancing_rate_limit << (20 -PAGE_SHIFT ); +numa_migration_adjust_threshold (pgdat, rate_limit, def_th); + + th = pgdat->numa_threshold ? : def_th; latency =numa_hint_fault_latency (page);if (latency > th)return false; - rate_limit = - sysctl_numa_balancing_rate_limit << (20 -PAGE_SHIFT );return numa_migration_check_rate_limit (pgdat, rate_limit,hpage_nr_pages (page)); }
Signature · 1 line
2.27.0