autonuma: Optimize memory placement in memory tiering system
Subsystems (10)
cover autonuma: Optimize memory placement in memory tiering system
From: Huang Ying <[email protected]>
With the advent of various new memory types, there may be multiple memory types in one machine, e.g. DRAM and PMEM (persistent memory). Because the performance and cost of the different types of memory may be different, the memory subsystem of the machine could be called memory tiering system.
After commit c221c0b0308f ("device-dax: "Hotplug" persistent memory for use like normal RAM"), the PMEM could be used as 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.
While in autonuma, there are 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 mechanisms to optimize 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,
[PATCH 0/4] [RFC] Migrate Pages in lieu of discard
https://lore.kernel.org/linux-mm/[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, so that the hot PMEM pages can be migrated to the DRAM node. This has been implemented in this patchset too.
The patchset is based on the following not-yet-merged patchset:
[PATCH 0/4] [RFC] Migrate Pages in lieu of discard
https://lore.kernel.org/linux-mm/[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 here.
http://lkml.kernel.org/r/[email protected]
With all above optimization, the score of pmbench memory accessing benchmark with 80:20 read/write ratio and normal access address distribution improves 116% on a 2 socket Intel server with Optane DC Persistent Memory.
Best Regards,
Huang, Ying
RFC 1/10 autonuma: Fix watermark checking in migrate_balanced_pgdat()
From: Huang Ying <[email protected]>
When zone_watermark_ok() is called in migrate_balanced_pgdat() to check migration target node, the parameter classzone_idx (for requested zone) is specified as 0 (ZONE_DMA). But when allocating memory for autonuma in alloc_misplaced_dst_page(), the requested zone from GFP flags is ZONE_MOVABLE. That is, the requested zone is different. The size of lowmem_reserve for the different requested zone is different. And this may cause some issues.
For example, in the zoneinfo of a test machine as below,
Node 0, zone DMA32
pages free 61592
min 29
low 454
high 879
spanned 1044480
present 442306
managed 425921
protection: (0, 0, 62457, 62457, 62457)The free page number of ZONE_DMA32 is greater than "high watermark + lowmem_reserve[ZONE_DMA]", but less than "high watermark + lowmem_reserve[ZONE_MOVABLE]". And because __alloc_pages_node() in alloc_misplaced_dst_page() requests ZONE_MOVABLE, the zone_watermark_ok() on ZONE_DMA32 in migrate_balanced_pgdat() may always return true. So, autonuma may not stop even when memory pressure in node 0 is heavy.
To fix the issue, ZONE_MOVABLE is used as parameter to call zone_watermark_ok() in migrate_balanced_pgdat(). This makes it same as requested zone in alloc_misplaced_dst_page(). So that migrate_balanced_pgdat() returns false when memory pressure is heavy.
--- mm/migrate.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-)
mm/migrate.c +1 -1
@@ -1954,7 +1954,7 @@ static bool migrate_balanced_pgdat(struct pglist_data *pgdat,if (!zone_watermark_ok (zone,0 ,high_wmark_pages (zone) + nr_migrate_pages, -0 ,0 )) +ZONE_MOVABLE ,0 ))continue ;return true; }
Signature · 1 line
2.23.0
Re: [RFC 01/10] autonuma: Fix watermark checking in migrate_balanced_pgdat()
Quoted 30 lines · Ying
From: Huang Ying <[email protected]>
When
zone_watermark_ok()is called inmigrate_balanced_pgdat()to check migration target node, the parameterclasszone_idx(for requested zone) is specified as 0 (ZONE_DMA). But when allocating memory for autonuma inalloc_misplaced_dst_page(), the requested zone from GFP flags isZONE_MOVABLE. That is, the requested zone is different. The size oflowmem_reservefor the different requested zone is different. And this may cause some issues.For example, in the zoneinfo of a test machine as below,
Node 0, zone DMA32
pages free 61592 min 29 low 454 high 879 spanned 1044480 present 442306 managed 425921 protection: (0, 0, 62457, 62457, 62457)The free page number of
ZONE_DMA32is greater than "high watermark + lowmem_reserve[ZONE_DMA]", but less than "high watermark + lowmem_reserve[ZONE_MOVABLE]". And because__alloc_pages_node()inalloc_misplaced_dst_page()requestsZONE_MOVABLE, thezone_watermark_ok()onZONE_DMA32inmigrate_balanced_pgdat()may always return true. So, autonuma may not stop even when memory pressure in node 0 is heavy.
Quoted 6 lines
To fix the issue,
ZONE_MOVABLEis used as parameter to callzone_watermark_ok()inmigrate_balanced_pgdat(). This makes it same as requested zone inalloc_misplaced_dst_page(). So thatmigrate_balanced_pgdat()returns false when memory pressure is heavy.Signed-off-by "Huang, Ying" <[email protected]>
This patch is independent of the series and should be resent separately. Alternatively Andrew, please pick this patch up on its own.
Signature · 2 lines
Mel Gorman SUSE Labs
RFC 2/10 autonuma: Reduce cache footprint when scanning page tables
In reply to Huang, YingFrom: Huang Ying <[email protected]>
In auto NUMA balancing page table scanning, if the pte_protnone() is true, the PTE needs not to be changed because it's in target state already. So other checking on corresponding struct page is unnecessary too.
So, if we check pte_protnone() firstly for each PTE, we can avoid unnecessary struct page accessing, so that reduce the cache footprint of NUMA balancing page table scanning.
In the performance test of pmbench memory accessing benchmark with 80:20 read/write ratio and normal access address distribution on a 2 socket Intel server with Optance DC Persistent Memory, perf profiling shows that the autonuma page table scanning time reduces from 1.23% to 0.97% (that is, reduced 21%) with the patch.
--- mm/mprotect.c | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-)
mm/mprotect.c +4 -4
@@ -80,6 +80,10 @@ static unsigned long change_pte_range(struct vm_area_struct *vma, pmd_t *pmd,if (prot_numa) {struct page *page; +/* Avoid TLB flush if possible */ +if (pte_protnone (oldpte)) +continue ; + page =vm_normal_page (vma, addr, oldpte);if (!page ||PageKsm (page))continue ;
@@ -97,10 +101,6 @@ static unsigned long change_pte_range(struct vm_area_struct *vma, pmd_t *pmd,if (page_is_file_cache (page) &&PageDirty (page))continue ; -/* Avoid TLB flush if possible */ -if (pte_protnone (oldpte)) -continue ; -/* * Don't mess with PTEs if page is already on the node * a single-threaded process is running on.
Signature · 1 line
2.23.0
Re: [RFC 02/10] autonuma: Reduce cache footprint when scanning page tables
Quoted 11 lines · Ying
From: Huang Ying <[email protected]>
In auto NUMA balancing page table scanning, if the
pte_protnone()is true, the PTE needs not to be changed because it's in target state already. So other checking on corresponding struct page is unnecessary too.So, if we check
pte_protnone()firstly for each PTE, we can avoid unnecessary struct page accessing, so that reduce the cache footprint of NUMA balancing page table scanning.
Quoted 7 lines
In the performance test of pmbench memory accessing benchmark with 80:20 read/write ratio and normal access address distribution on a 2 socket Intel server with Optance DC Persistent Memory, perf profiling shows that the autonuma page table scanning time reduces from 1.23% to 0.97% (that is, reduced 21%) with the patch.
Signed-off-by "Huang, Ying" <[email protected]>
This patch is independent of the series and should be resent separately. Alternatively Andrew, please pick this patch up on its own.
Signature · 2 lines
Mel Gorman SUSE Labs
RFC 3/10 autonuma: Add NUMA_BALANCING_MEMORY_TIERING mode
In reply to Huang, YingFrom: Huang Ying <[email protected]>
With the advent of various new memory types, some machines will have multiple memory types, e.g. DRAM and PMEM (persistent memory). Because the performance of the different types of memory may be different, the memory subsystem could be called memory tiering system.
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). And in autonuma, there are a set of mechanisms to identify the pages recently accessed by the CPUs in a node and migrate the pages to the node. So the performance optimization to promote the hot pages in slow memory node to the fast memory node in the memory tiering system could be implemented based on the autonuma framework.
But the requirement of the hot page promotion in the memory tiering system is different from that of the normal NUMA balancing in some aspects. E.g. for the hot page promotion, we can skip to scan fastest memory node because we have nowhere to promote the hot pages to. To make autonuma works for both the normal NUMA balancing and the memory tiering hot page promotion, we have defined a set of flags and made the value of sysctl_numa_balancing_mode to be "OR" of these flags. The flags are as follows,
- 0x0: NUMA_BALANCING_DISABLED
- 0x1: NUMA_BALANCING_NORMAL
- 0x2: NUMA_BALANCING_MEMORY_TIERING
NUMA_BALANCING_NORMAL enables the normal NUMA balancing across sockets, while NUMA_BALANCING_MEMORY_TIERING enables the hot page promotion across memory tiers. They can be enabled individually or together. If all flags are cleared, the autonuma is disabled completely.
The sysctl interface is extended accordingly in a backward compatible way.
TODO:
- Update ABI document: Documentation/sysctl/kernel.txt
--- include/linux/sched/sysctl.h | 5 +++++ kernel/sched/core.c | 9 +++------ kernel/sysctl.c | 7 ++++--- 3 files changed, 12 insertions(+), 9 deletions(-)
include/linux/sched/sysctl.h +5 -0
@@ -33,6 +33,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
@@ -2169,6 +2169,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
@@ -2184,20 +2185,16 @@ void set_numabalancing_state(bool enabled)int sysctl_numa_balancing (struct ctl_table *table,int write,void __user *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
@@ -129,6 +129,7 @@ static int __maybe_unused neg_one = -1;static int zero;static int __maybe_unused 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 ;
@@ -422,12 +423,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 = &zero, - .extra2 = &one, + .extra2 = &three, },#endif /* CONFIG_NUMA_BALANCING */ #endif /* CONFIG_SCHED_DEBUG */
Signature · 1 line
2.23.0
RFC 4/10 autonuma, memory tiering: Rate limit NUMA migration throughput
In reply to Huang, YingFrom: Huang Ying <[email protected]>
In autonuma memory tiering mode, the hot PMEM (persistent memory) pages could be migrated to DRAM 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, the migration throughput should be rate-limited.
At the other hand, in some situation, for example, some workloads exits, many DRAM pages become free, so that some pages of the other workloads can be migrated to DRAM. To respond to the workloads changing quickly, it's better to migrate pages faster.
To address the above 2 requirements, a rate limit algorithm as follows is used,
- If there is enough free memory in DRAM node (that is, > high watermark + 2 * rate limit pages), then NUMA migration throughput will not be rate-limited to respond to the workload changing quickly.
- Otherwise, counting the number of pages to try to migrate to a DRAM node via autonuma, if the count exceeds the limit specified by the users, stop NUMA migration until the next second.
A new sysctl knob kernel.numa_balancing_rate_limit_mbps is added for the users to specify the limit. If its value is 0, the default value (high watermark) will be used.
TODO: Add ABI document for new sysctl knob.
--- include/linux/mmzone.h | 7 ++++ include/linux/sched/sysctl.h | 1 + kernel/sched/fair.c | 63 ++++++++++++++++++++++++++++++++++++ kernel/sysctl.c | 8 +++++ mm/vmstat.c | 3 ++ 5 files changed, 82 insertions(+)
include/linux/mmzone.h +7 -0
@@ -247,6 +247,9 @@ enum node_stat_item {NR_DIRTIED ,/* page dirtyings since bootup */ NR_WRITTEN ,/* page writings since bootup */ NR_KERNEL_MISC_RECLAIMABLE ,/* reclaimable non-slab kernel pages */ +#ifdef CONFIG_NUMA_BALANCING +NUMA_TRY_MIGRATE ,/* pages to try to migrate via NUMA balancing */ +#endif NR_VM_NODE_STAT_ITEMS };
@@ -766,6 +769,10 @@ typedef struct pglist_data {unsigned long split_queue_len;#endif +#ifdef CONFIG_NUMA_BALANCING +unsigned long autonuma_jiffies; +unsigned long autonuma_try_migrate; +#endif /* Fields commonly accessed by the page reclaim scanner */ struct lruvec lruvec;
include/linux/sched/sysctl.h +1 -0
@@ -42,6 +42,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_rate_limit;#ifdef CONFIG_SCHED_DEBUG extern __read_mostly unsigned int sysctl_sched_migration_cost;
kernel/sched/fair.c +63 -0
81 lines not on this page · raw message
kernel/sysctl.c +8 -0
@@ -421,6 +421,14 @@ static struct ctl_table kern_table[] = { .proc_handler = proc_dointvec_minmax, .extra1 = &one, }, + { + .procname = "numa_balancing_rate_limit_mbps", + .data = &sysctl_numa_balancing_rate_limit, + .maxlen = sizeof(unsigned int), + .mode = 0644, + .proc_handler = proc_dointvec_minmax, + .extra1 = &zero, + }, { .procname = "numa_balancing", .data = &sysctl_numa_balancing_mode,
mm/vmstat.c +3 -0
@@ -1198,6 +1198,9 @@ const char * const vmstat_text[] = {"nr_dirtied" ,"nr_written" ,"nr_kernel_misc_reclaimable" , +#ifdef CONFIG_NUMA_BALANCING +"numa_try_migrate" , +#endif/* enum writeback_stat_item counters */ "nr_dirty_threshold",
Signature · 1 line
2.23.0
RFC 5/10 autonuma, memory tiering: Use kswapd to demote cold pages to PMEM
In reply to Huang, YingFrom: Huang Ying <[email protected]>
In a memory tiering system, if the memory size of the workloads is smaller than that of the faster memory (e.g. DRAM) nodes, all pages of the workloads should be put in the faster memory nodes. But this makes it unnecessary to use slower memory (e.g. PMEM) at all.
So in common cases, the memory size of the workload should be larger than that of the faster memory nodes. And to optimize the performance, the hot pages should be promoted to the faster memory nodes while the cold pages should be demoted to the slower memory nodes. To achieve that, we have two choices,
a. Promote the hot pages from the slower memory node to the faster
memory node. This will create some memory pressure in the faster memory node, thus trigger the memory reclaiming, where the cold pages will be demoted to the slower memory node.
b. Demote the cold pages from faster memory node to the slower memory
node. This will create some free memory space in the faster memory node, and the hot pages in the slower memory node could be promoted to the faster memory node.
The choice "a" will create the memory pressure in the faster memory node. If the memory pressure of the workload is high too, 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, it will consume the free memory and the hot pages promotion will stop earlier if its allocation watermark is higher than that of the normal memory allocation.
In this patch, choice "b" is implemented. If memory tiering NUMA balancing mode is enabled, the node isn't the slowest node, and the free memory size of the node is below the high watermark, the kswapd of the node will be waken up to free some memory until the free memory size is above the high watermark + autonuma promotion rate limit. If the free memory size is below the high watermark, autonuma promotion will stop working. This avoids to create too much memory pressure to the system.
--- mm/migrate.c | 26 +++++++++++++++++--------- mm/vmscan.c | 7 +++++++ 2 files changed, 24 insertions(+), 9 deletions(-)
mm/migrate.c +17 -9
@@ -47,6 +47,7 @@#include <linux/page_owner.h> #include <linux/sched/mm.h> #include <linux/ptrace.h> +#include <linux/sched/sysctl.h> #include <asm/tlbflush.h>
@@ -1939,8 +1940,7 @@ COMPAT_SYSCALL_DEFINE6(move_pages, pid_t, pid, compat_ulong_t, nr_pages,* Returns true if this is a safe migration target node for misplaced NUMA * pages. Currently it only checks the watermarks which crude */ -static bool migrate_balanced_pgdat (struct pglist_data *pgdat, -unsigned long nr_migrate_pages) +static bool migrate_balanced_pgdat (struct pglist_data *pgdat,int order) {int z;
@@ -1951,12 +1951,9 @@ static bool migrate_balanced_pgdat(struct pglist_data *pgdat,continue ;/* Avoid waking kswapd by allocating pages_to_migrate pages. */ -if (!zone_watermark_ok (zone,0 , -high_wmark_pages (zone) + - nr_migrate_pages, -ZONE_MOVABLE ,0 )) -continue ; -return true; +if (zone_watermark_ok (zone, order,high_wmark_pages (zone), +ZONE_MOVABLE ,0 )) +return true; }return false; }
@@ -1983,8 +1980,19 @@ static int numamigrate_isolate_page(pg_data_t *pgdat, struct page *page)VM_BUG_ON_PAGE (compound_order (page) && !PageTransHuge (page), page);/* Avoid migrating to a node that is nearly full */ -if (!migrate_balanced_pgdat (pgdat,1UL <<compound_order (page))) +if (!migrate_balanced_pgdat (pgdat,compound_order (page))) { +if (sysctl_numa_balancing_mode &NUMA_BALANCING_MEMORY_TIERING ) { +int z; + +for (z = pgdat->nr_zones -1 ; z >=0 ; z--) { +if (populated_zone (pgdat->node_zones + z)) +break ; + } +wakeup_kswapd (pgdat->node_zones + z, +0 ,compound_order (page),ZONE_MOVABLE ); + }return 0 ; + }if (isolate_lru_page (page))return 0 ;
mm/vmscan.c +7 -0
@@ -57,6 +57,7 @@#include <linux/swapops.h> #include <linux/balloon_compaction.h> +#include <linux/sched/sysctl.h> #include "internal.h"
@@ -3336,8 +3337,11 @@ static bool pgdat_balanced(pg_data_t *pgdat, int order, int classzone_idx) {int i;unsigned long mark =-1 ; +unsigned long promote_ratelimit;struct zone *zone; + promote_ratelimit = sysctl_numa_balancing_rate_limit << + (20 -PAGE_SHIFT );/* * Check watermarks bottom-up as lower zones are more likely to * meet watermarks.
@@ -3349,6 +3353,9 @@ static bool pgdat_balanced(pg_data_t *pgdat, int order, int classzone_idx)continue ; mark =high_wmark_pages (zone); +if (sysctl_numa_balancing_mode &NUMA_BALANCING_MEMORY_TIERING && +next_migration_node (pgdat->node_id) !=-1 ) + mark += promote_ratelimit;if (zone_watermark_ok_safe (zone, order, mark, classzone_idx))return true; }
Signature · 1 line
2.23.0
RFC 6/10 autonuma, memory tiering: Skip to scan fastest memory
In reply to Huang, YingFrom: Huang Ying <[email protected]>
In memory tiering NUMA balancing mode, the hot pages of the workload in the fastest memory node couldn't be promoted to anywhere, so it's unnecessary to identify the hot pages in the fastest memory node via changing their PTE mapping to have PROT_NONE. So that the page faults could be avoided too.
The patch improves the score of pmbench memory accessing benchmark with 80:20 read/write ratio and normal access address distribution by 4.6% on a 2 socket Intel server with Optance DC Persistent Memory. The autonuma hint faults for DRAM node is reduced to almost 0 in the test.
Known problem: the statistics of autonuma such as per-node memory accesses, and local/remote ratio, etc. will be influenced. Especially the NUMA scanning period automatic adjustment will not work reasonably. So we cannot rely on that. Fortunately, there's no CPU in the PMEM NUMA nodes, so we will not move tasks there because of the statistics issue.
--- mm/huge_memory.c | 30 +++++++++++++++++++++--------- mm/mprotect.c | 14 +++++++++++++- 2 files changed, 34 insertions(+), 10 deletions(-)
mm/huge_memory.c +21 -9
@@ -32,6 +32,7 @@#include <linux/shmem_fs.h> #include <linux/oom.h> #include <linux/numa.h> +#include <linux/sched/sysctl.h> #include <asm/tlb.h> #include <asm/pgalloc.h>
@@ -1937,17 +1938,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 if normal numa balancing is disabled and no +* faster memory node to promote to +*/ +if (!(sysctl_numa_balancing_mode &NUMA_BALANCING_NORMAL ) && +next_promotion_node (page_to_nid (page)) ==-1 ) + goto unlock; + }/* * In case prot_numa, we are under down_read(mmap_sem). It's critical * to not clear pmd intermittently to avoid race with MADV_DONTNEED
mm/mprotect.c +13 -1
@@ -28,6 +28,7 @@#include <linux/ksm.h> #include <linux/uaccess.h> #include <linux/mm_inline.h> +#include <linux/sched/sysctl.h> #include <asm/pgtable.h> #include <asm/cacheflush.h> #include <asm/mmu_context.h>
@@ -79,6 +80,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))
@@ -105,7 +107,17 @@ 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 if normal numa +* balancing is disabled and no faster +* memory node to promote to +*/ +if (!(sysctl_numa_balancing_mode &NUMA_BALANCING_NORMAL ) && +next_promotion_node (nid) ==-1 )continue ; }
Signature · 1 line
2.23.0
RFC 7/10 autonuma, memory tiering: Only promote page if accessed twice
In reply to Huang, YingFrom: Huang Ying <[email protected]>
The original assumption of auto NUMA balancing is that the memory privately or mainly accessed by the CPUs of a NUMA node (called private memory) should fit the memory size of the NUMA node. So if a page is identified to be private memory, it will be migrated to the target node immediately. Eventually all private memory will be migrated.
But this assumption isn't true in memory tiering system. 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). To take full advantage of the system resources, it's common that the size of the private memory of the workload is larger than the memory size of the fast memory node.
To resolve the issue, we will try to migrate only the hot pages in the private memory to the fast memory node. A private page that was accessed at least twice in the current and the last scanning periods will be identified as the hot page and migrated. Otherwise, the page isn't considered hot enough to be migrated.
To record whether a page is accessed in the last scanning period, the Accessed bit of the PTE/PMD is used. When the page tables are scanned for autonuma, if the pte_protnone(pte) is true, the page isn't accessed in the last scan period, and the Accessed bit will be cleared, otherwise the Accessed bit will be kept. When NUMA page fault occurs, if the Accessed bit is set, the page has been accessed at least twice in the current and the last scanning period and will be migrated.
The Accessed bit of PTE/PMD is used by page reclaiming too. So the conflict is possible. Considering the following situation,
a) the page is moved from active list to inactive list with Accessed bit cleared
b) the page is accessed, so Accessed bit is set
c) the page table is scanned by autonuma, PTE is set to PROTNONE+Accessed
c) the page isn't accessed
d) the page table is scanned by autonuma again, Accessed is cleared
e) the inactive list is scanned for reclaiming, the page is reclaimed wrongly because Accessed bit is cleared by autonuma
Although the page is reclaimed wrongly, it hasn't been accessed for one numa balancing scanning period at least. So the page isn't so hot too. That is, this shouldn't be a severe issue.
The patch improves the score of pmbench memory accessing benchmark with 80:20 read/write ratio and normal access address distribution by 3.1% on a 2 socket Intel server with Optance DC Persistent Memory. In the test, the number of the promoted pages for autonuma reduces 7.2% because the pages fail to pass the twice access checking.
Problems:
- how to adjust scanning period upon hot page identification requirement. E.g. if the count of page promotion is much larger than free memory, we need to scan faster to identify really hot pages. But his will trigger too many page faults too.
--- mm/huge_memory.c | 13 ++++++++++++- mm/memory.c | 28 +++++++++++++++------------- mm/mprotect.c | 11 ++++++++++- 3 files changed, 37 insertions(+), 15 deletions(-)
mm/huge_memory.c +12 -1
@@ -1528,6 +1528,10 @@ vm_fault_t do_huge_pmd_numa_page(struct vm_fault *vmf, pmd_t pmd)if (unlikely (!pmd_same (pmd, *vmf->pmd))) goto out_unlock; +/* Only migrate if accessed twice */ +if (!pmd_young (*vmf->pmd)) + goto out_unlock; +/* * If there are potential migrations, wait for completion and retry * without disrupting NUMA hinting information. Do not relock and
@@ -1948,8 +1952,15 @@ int change_huge_pmd(struct vm_area_struct *vma, pmd_t *pmd,if (is_huge_zero_pmd (*pmd)) goto unlock; -if (pmd_protnone (*pmd)) +if (pmd_protnone (*pmd)) { +/* +* PMD young bit is used to record whether the +* page is accessed in last scan period +*/ +if (pmd_young (*pmd)) +set_pmd_at (mm, addr, pmd,pmd_mkold (*pmd)); goto unlock; + } page =pmd_page (*pmd);/*
mm/memory.c +15 -13
@@ -3711,10 +3711,8 @@ static vm_fault_t do_numa_page(struct vm_fault *vmf)*/ vmf->ptl =pte_lockptr (vma->vm_mm, vmf->pmd);spin_lock (vmf->ptl); -if (unlikely (!pte_same (*vmf->pte, vmf->orig_pte))) { -pte_unmap_unlock (vmf->pte, vmf->ptl); - goto out; - } +if (unlikely (!pte_same (*vmf->pte, vmf->orig_pte))) + goto unmap_out;/* * Make it present again, Depending on how arch implementes non
@@ -3728,17 +3726,17 @@ static vm_fault_t do_numa_page(struct vm_fault *vmf)ptep_modify_prot_commit (vma, vmf->address, vmf->pte, old_pte, pte);update_mmu_cache (vma, vmf->address, vmf->pte); +/* Only migrate if accessed twice */ +if (!pte_young (old_pte)) + goto unmap_out; + page =vm_normal_page (vma, vmf->address, pte); -if (!page) { -pte_unmap_unlock (vmf->pte, vmf->ptl); -return 0 ; - } +if (!page) + goto unmap_out;/* TODO: handle PTE-mapped THP */ -if (PageCompound (page)) { -pte_unmap_unlock (vmf->pte, vmf->ptl); -return 0 ; - } +if (PageCompound (page)) + goto unmap_out;/* * Avoid grouping on RO pages in general. RO pages shouldn't hurt as
@@ -3776,10 +3774,14 @@ static vm_fault_t do_numa_page(struct vm_fault *vmf) }else flags |=TNF_MIGRATE_FAIL ; -out:if (page_nid !=NUMA_NO_NODE )task_numa_fault (last_cpupid, page_nid,1 , flags);return 0 ; + +unmap_out: +pte_unmap_unlock (vmf->pte, vmf->ptl); +out: +return 0 ; }static inline vm_fault_t create_huge_pmd (struct vm_fault *vmf)
mm/mprotect.c +10 -1
@@ -83,8 +83,17 @@ static unsigned long change_pte_range(struct vm_area_struct *vma, pmd_t *pmd,int nid;/* Avoid TLB flush if possible */ -if (pte_protnone (oldpte)) +if (pte_protnone (oldpte)) { +/* +* PTE young bit is used to record +* whether the page is accessed in +* last scan period +*/ +if (pte_young (oldpte)) +set_pte_at (vma->vm_mm, addr, pte, +pte_mkold (oldpte));continue ; + } page =vm_normal_page (vma, addr, oldpte);if (!page ||PageKsm (page))
Signature · 1 line
2.23.0
RFC 8/10 autonuma, memory tiering: Select hotter pages to promote to fast memory node
In reply to Huang, YingFrom: Huang Ying <[email protected]>
In memory tiering system, to maximize the overall system performance, the hot pages should be put in the fast memory node while the cold pages should be put in the slow memory node. In original memory tiering autonuma implementation, we will try to promote almost all recently accessed pages, and use the LRU algorithm in page reclaiming to keep the hot pages in the fast memory node and demote the cold pages to the slow memory node. The problem of this solution is that the cold pages with a low access frequency may be promoted then demoted too. So that the memory bandwidth is wasted. And because migration is rate-limited, the hot pages need to compete with the cold pages for the limited migration bandwidth.
If we could select the hotter pages to promote to the fast memory node in the first place, then the wasted migration bandwidth would be reduced and the hot pages would be promoted more quickly.
The patch "autonuma, memory tiering: Only promote page if accessed twice" in the series will prevent the really cold pages that are not accessed in the last scan period from being promoted. But the scan period could be as long as tens seconds, so it doesn't work well enough on selecting the hotter pages.
To identify the hotter pages, in this patch we implemented a method based on autonuma page table scanning and hint page fault as follow,
- When a range of the page table is scanned in autonuma, the timestamp and the address range is recorded in a ring buffer in struct mm_struct. So we have information of recent N scans.
- When the autonuma hint page fault occurs, the fault address is searched in the ring buffer to get its scanning timestamp. The hint page fault latency is defined as
hint page fault timestamp - scan timestamp
If the access frequency of the hotter pages is higher, the probability for their hint page fault latency to be shorter is higher too. So the hint page fault latency is a good estimation of the page heat.
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 9.2% with 50.3% fewer NUMA page migrations on a 2 socket Intel server with Optance DC Persistent Memory. That is, the cost of autonuma page migration reduces considerably.
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 may not be shorter than the hot threshold. So the pages may 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 (> high watermark + 2 * promotion rate limit), 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/mempolicy.h | 5 +- include/linux/mm_types.h | 5 ++ include/linux/sched/numa_balancing.h | 8 ++- include/linux/sched/sysctl.h | 1 + kernel/sched/fair.c | 83 +++++++++++++++++++++++++--- kernel/sysctl.c | 7 +++ mm/huge_memory.c | 6 +- mm/memory.c | 7 +-- mm/mempolicy.c | 7 ++- 9 files changed, 109 insertions(+), 20 deletions(-)
include/linux/mempolicy.h +3 -2
@@ -202,7 +202,8 @@ static inline bool vma_migratable(struct vm_area_struct *vma) return true; } -extern int mpol_misplaced (struct page *,struct vm_area_struct *,unsigned long ); +extern int mpol_misplaced (struct page *,struct vm_area_struct *,unsigned long , +int flags);extern void mpol_put_task_policy (struct task_struct *);#else
@@ -300,7 +301,7 @@ static inline int mpol_parse_str(char *str, struct mempolicy **mpol)#endif static inline int mpol_misplaced (struct page *page,struct vm_area_struct *vma, -unsigned long address) +unsigned long address,int flags) {return -1 ;/* no node preference */ }
include/linux/mm_types.h +5 -0
@@ -484,6 +484,11 @@ struct mm_struct {/* numa_scan_seq prevents two threads setting pte_numa */ int numa_scan_seq; + +#define NUMA_SCAN_NR_HIST 16 +int numa_scan_idx; +unsigned long numa_scan_jiffies[NUMA_SCAN_NR_HIST ]; +unsigned long numa_scan_starts[NUMA_SCAN_NR_HIST ];#endif /* * An operation with batched TLB flushing is going on. Anything
include/linux/sched/numa_balancing.h +6 -2
@@ -14,6 +14,7 @@#define TNF_SHARED 0x04#define TNF_FAULT_LOCAL 0x08#define TNF_MIGRATE_FAIL 0x10 +#define TNF_YOUNG 0x20#ifdef CONFIG_NUMA_BALANCING extern void task_numa_fault (int last_node,int node,int pages,int flags);
@@ -21,7 +22,8 @@ extern pid_t task_numa_group_id(struct task_struct *p);extern void set_numabalancing_state (bool enabled);extern void task_numa_free (struct task_struct *p);extern bool should_numa_migrate_memory (struct task_struct *p,struct page *page, -int src_nid,int dst_cpu); +int src_nid,int dst_cpu, +unsigned long addr,int flags);#else static inline void task_numa_fault (int last_node,int node,int pages,int flags)
@@ -38,7 +40,9 @@ static inline void task_numa_free(struct task_struct *p) { }static inline bool should_numa_migrate_memory (struct task_struct *p, -struct page *page,int src_nid,int dst_cpu) +struct page *page,int src_nid, +int dst_cpu,unsigned long addr, +int flags) {return true; }
include/linux/sched/sysctl.h +1 -0
@@ -43,6 +43,7 @@ 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_rate_limit; +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 +76 -7
154 lines not on this page · raw message
kernel/sysctl.c +7 -0
@@ -429,6 +429,13 @@ static struct ctl_table kern_table[] = { .proc_handler = proc_dointvec_minmax, .extra1 = &zero, }, + { + .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 +3 -3
@@ -1529,8 +1529,8 @@ vm_fault_t do_huge_pmd_numa_page(struct vm_fault *vmf, pmd_t pmd) goto out_unlock;/* Only migrate if accessed twice */ -if (!pmd_young (*vmf->pmd)) - goto out_unlock; +if (pmd_young (*vmf->pmd)) + flags |=TNF_YOUNG ;/* * If there are potential migrations, wait for completion and retry
@@ -1565,7 +1565,7 @@ vm_fault_t do_huge_pmd_numa_page(struct vm_fault *vmf, pmd_t pmd)* page_table_lock if at all possible */ page_locked =trylock_page (page); - target_nid =mpol_misplaced (page, vma, haddr); + target_nid =mpol_misplaced (page, vma, haddr, flags);if (target_nid ==NUMA_NO_NODE ) {/* If the page was locked, there are no parallel migrations */ if (page_locked)
mm/memory.c +3 -4
@@ -3689,7 +3689,7 @@ static int numa_migrate_prep(struct page *page, struct vm_area_struct *vma, *flags |=TNF_FAULT_LOCAL ; } -return mpol_misplaced (page, vma, addr); +return mpol_misplaced (page, vma, addr, *flags); }static vm_fault_t do_numa_page (struct vm_fault *vmf)
@@ -3726,9 +3726,8 @@ static vm_fault_t do_numa_page(struct vm_fault *vmf)ptep_modify_prot_commit (vma, vmf->address, vmf->pte, old_pte, pte);update_mmu_cache (vma, vmf->address, vmf->pte); -/* Only migrate if accessed twice */ -if (!pte_young (old_pte)) - goto unmap_out; +if (pte_young (old_pte)) + flags |=TNF_YOUNG ; page =vm_normal_page (vma, vmf->address, pte);if (!page)
mm/mempolicy.c +5 -2
@@ -2315,6 +2315,7 @@ static void sp_free(struct sp_node *n)* @page: page to be checked * @vma: vm area where page mapped * @addr: virtual address where page mapped +* @flags: numa balancing flags * * Lookup current policy node id for vma,addr and "compare to" page's * node id.
@@ -2326,7 +2327,8 @@ static void sp_free(struct sp_node *n)* Policy determination "mimics" alloc_page_vma(). * Called from fault path where we know the vma and faulting address. */ -int mpol_misplaced (struct page *page,struct vm_area_struct *vma,unsigned long addr) +int mpol_misplaced (struct page *page,struct vm_area_struct *vma, +unsigned long addr,int flags) {struct mempolicy *pol;struct zoneref *z;
@@ -2380,7 +2382,8 @@ int mpol_misplaced(struct page *page, struct vm_area_struct *vma, unsigned longif (pol->flags &MPOL_F_MORON ) { polnid = thisnid; -if (!should_numa_migrate_memory (current, page, curnid, thiscpu)) +if (!should_numa_migrate_memory (current, page, curnid, + thiscpu, addr, flags)) goto out; }
Signature · 1 line
2.23.0
Peter Zijlstra
maintainerRe: [RFC 08/10] autonuma, memory tiering: Select hotter pages to promote to fast memory node
include/linux/mm_types.h struct mm_struct { · line 491
Quoted 12 lines · Ying
index
8ec38b11b361..59e2151734ab100644include/linux/mm_types.h +5
-0@@ -484,6 +484,11 @@ struct mm_struct {/* numa_scan_seq prevents two threads setting pte_numa */ int numa_scan_seq; + +#define NUMA_SCAN_NR_HIST 16 +int numa_scan_idx; +unsigned long numa_scan_jiffies[NUMA_SCAN_NR_HIST ]; +unsigned long numa_scan_starts[NUMA_SCAN_NR_HIST ];
Why 16? This is 4 cachelines.
Quoted 9 lines
include/linux/mm_types.h +5
-0#endif /* * An operation with batched TLB flushing is going on. Anything +static long numa_hint_fault_latency(struct task_struct *p, unsigned long addr) +{ +struct mm_struct *mm = p->mm; +unsigned long now = jiffies; +unsigned long start, end;
include/linux/mm_types.h struct mm_struct {
Quoted 10 lines
include/linux/mm_types.h +10
-0+int i, j; +long latency =0 ; + + i =READ_ONCE (mm->numa_scan_idx); + i = i ? i -1 :NUMA_SCAN_NR_HIST -1 ; +/* +* Paired with smp_wmb() in task_numa_work() to check +* scan range buffer after get current index +*/ +smp_rmb ();
That wants to be:
i = smp_load_acquire(&mm->numa_scan_idx) i = (i - 1) % NUMA_SCAN_NR_HIST;
(and because NUMA_SCAN_NR_HIST is a power of 2, the compiler will conveniently make that a bitwise and operation)
And: "DEC %0; AND $15, %0" is so much faster than a branch.
Quoted 4 lines
include/linux/mm_types.h +4
-0+ end =READ_ONCE (mm->numa_scan_offset); + start =READ_ONCE (mm->numa_scan_starts[i]); +if (start == end) + end = start +MAX_SCAN_WINDOW * (1UL <<22 );
include/linux/mm_types.h
Quoted 10 lines
include/linux/mm_types.h +10
-0+for (j =0 ; j <NUMA_SCAN_NR_HIST ; j++) { + latency = now -READ_ONCE (mm->numa_scan_jiffies[i]); + start =READ_ONCE (mm->numa_scan_starts[i]); +/* Scan pass the end of address space */ +if (end < start) + end =TASK_SIZE ; +if (addr >= start && addr < end) +return latency; + end = start; + i = i ? i -1 :NUMA_SCAN_NR_HIST -1 ;
i = (i - 1) % NUMA_SCAN_NR_HIST;
Quoted 15 lines
include/linux/mm_types.h +10
-0+ } +/* +* The tracking window isn't large enough, approximate to the +* max latency in the tracking window. +*/ +return latency; +}@@ -2583,6 +2640,19 @@ void task_numa_work(struct callback_head *work) start =0 ; vma = mm->mmap; } + idx = mm->numa_scan_idx; +WRITE_ONCE (mm->numa_scan_starts[idx], start); +WRITE_ONCE (mm->numa_scan_jiffies[idx], jiffies);
include/linux/mm_types.h void task_numa_work(struct callback_head *work) · line 2655
Quoted 10 lines
include/linux/mm_types.h +10
-0+/* +* Paired with smp_rmb() in should_numa_migrate_memory() to +* update scan range buffer index after update the buffer +* contents. +*/ +smp_wmb (); +if (idx +1 >=NUMA_SCAN_NR_HIST ) +WRITE_ONCE (mm->numa_scan_idx,0 ); +else +WRITE_ONCE (mm->numa_scan_idx, idx +1 );
smp_store_release(&mm->nums_scan_idx, idx % NUMA_SCAN_NR_HIST);
Re: [RFC 08/10] autonuma, memory tiering: Select hotter pages to promote to fast memory node
Hi, Peter,
Quoted 6 lines · Peter Zijlstra
Quoted 5 lines · Ying
index
8ec38b11b361..59e2151734ab100644include/linux/mm_types.h +0
-0@@ -484,6 +484,11 @@ struct mm_struct {
Quoted 9 lines
include/linux/mm_types.h struct mm_struct { · line 491
Quoted 7 lines
include/linux/mm_types.h +5
-0/* numa_scan_seq prevents two threads setting pte_numa */ int numa_scan_seq; + +#define NUMA_SCAN_NR_HIST 16 +int numa_scan_idx; +unsigned long numa_scan_jiffies[NUMA_SCAN_NR_HIST ]; +unsigned long numa_scan_starts[NUMA_SCAN_NR_HIST ];Why 16? This is 4 cachelines.
We want to keep the NUMA scanning history reasonably long. From task_scan_min(), the minimal interval between task_numa_work() running is about 100 ms by default. So we can keep 1600 ms history by default if NUMA_SCAN_NR_HIST is 16. If user choose to use smaller sysctl_numa_balancing_scan_size, then we can only keep shorter history. In general, we want to keep no less than 1000 ms history. So 16 appears like a reasonable choice for us. Any other suggestion?
Quoted 22 lines
Quoted 9 lines
include/linux/mm_types.h +5
-0#endif /* * An operation with batched TLB flushing is going on. Anything +static long numa_hint_fault_latency(struct task_struct *p, unsigned long addr) +{ +struct mm_struct *mm = p->mm; +unsigned long now = jiffies; +unsigned long start, end; include/linux/mm_types.h struct mm_struct {
Quoted 10 lines
include/linux/mm_types.h +10
-0+int i, j; +long latency =0 ; + + i =READ_ONCE (mm->numa_scan_idx); + i = i ? i -1 :NUMA_SCAN_NR_HIST -1 ; +/* +* Paired with smp_wmb() in task_numa_work() to check +* scan range buffer after get current index +*/ +smp_rmb ();That wants to be:
Quoted 7 lines
i = smp_load_acquire(&mm->numa_scan_idx) i = (i - 1) % NUMA_SCAN_NR_HIST;(and because
NUMA_SCAN_NR_HISTis a power of 2, the compiler will conveniently make that a bitwise and operation)And: "DEC %0; AND $15, %0" is so much faster than a branch.
This looks much better. Thanks! I will use it in the next version.
Quoted 8 lines
Quoted 8 lines
include/linux/mm_types.h +8
-0+ end =READ_ONCE (mm->numa_scan_offset); + start =READ_ONCE (mm->numa_scan_starts[i]); +if (start == end) + end = start +MAX_SCAN_WINDOW * (1UL <<22 ); +for (j =0 ; j <NUMA_SCAN_NR_HIST ; j++) { + latency = now -READ_ONCE (mm->numa_scan_jiffies[i]); + start =READ_ONCE (mm->numa_scan_starts[i]); +/* Scan pass the end of address space */
Quoted 8 lines
include/linux/mm_types.h
Quoted 6 lines
include/linux/mm_types.h +6
-0+if (end < start) + end =TASK_SIZE ; +if (addr >= start && addr < end) +return latency; + end = start; + i = i ? i -1 :NUMA_SCAN_NR_HIST -1 ;i = (i - 1) % NUMA_SCAN_NR_HIST;
Will use this in the next version.
Quoted 19 lines
Quoted 19 lines
include/linux/mm_types.h +14
-0+ } +/* +* The tracking window isn't large enough, approximate to the +* max latency in the tracking window. +*/ +return latency; +}@@ -2583,6 +2640,19 @@ void task_numa_work(struct callback_head *work) start =0 ; vma = mm->mmap; } + idx = mm->numa_scan_idx; +WRITE_ONCE (mm->numa_scan_starts[idx], start); +WRITE_ONCE (mm->numa_scan_jiffies[idx], jiffies); +/* +* Paired with smp_rmb() in should_numa_migrate_memory() to +* update scan range buffer index after update the buffer +* contents.
Quoted 8 lines
include/linux/mm_types.h void task_numa_work(struct callback_head *work) · line 2655
Quoted 6 lines
include/linux/mm_types.h +6
-0+*/ +smp_wmb (); +if (idx +1 >=NUMA_SCAN_NR_HIST ) +WRITE_ONCE (mm->numa_scan_idx,0 ); +else +WRITE_ONCE (mm->numa_scan_idx, idx +1 );smp_store_release(&mm->nums_scan_idx, idx % NUMA_SCAN_NR_HIST);
Will use this in the next version.
Best Regards,
Huang, Ying
Peter Zijlstra
maintainerRe: [RFC 08/10] autonuma, memory tiering: Select hotter pages to promote to fast memory node
Quoted 7 lines · Ying
Quoted 6 lines
include/linux/mm_types.h struct mm_struct { · line 491
Quoted 4 lines
include/linux/mm_types.h +4
-0+#define NUMA_SCAN_NR_HIST 16 +int numa_scan_idx; +unsigned long numa_scan_jiffies[NUMA_SCAN_NR_HIST ]; +unsigned long numa_scan_starts[NUMA_SCAN_NR_HIST ];Why 16? This is 4 cachelines.
Quoted 7 lines
We want to keep the NUMA scanning history reasonably long. From
task_scan_min(), the minimal interval betweentask_numa_work()running is about 100 ms by default. So we can keep 1600 ms history by default ifNUMA_SCAN_NR_HISTis 16. If user choose to use smallersysctl_numa_balancing_scan_size, then we can only keep shorter history. In general, we want to keep no less than 1000 ms history. So 16 appears like a reasonable choice for us. Any other suggestion?
This is very good information for Changelogs and comments :-)
Re: [RFC 08/10] autonuma, memory tiering: Select hotter pages to promote to fast memory node
Quoted 17 lines · Peter Zijlstra
Quoted 7 lines · Ying
Quoted 6 lines
include/linux/mm_types.h struct mm_struct { · line 491
Quoted 4 lines
include/linux/mm_types.h +4
-0+#define NUMA_SCAN_NR_HIST 16 +int numa_scan_idx; +unsigned long numa_scan_jiffies[NUMA_SCAN_NR_HIST ]; +unsigned long numa_scan_starts[NUMA_SCAN_NR_HIST ];Why 16? This is 4 cachelines.
Quoted 7 lines
We want to keep the NUMA scanning history reasonably long. From
task_scan_min(), the minimal interval betweentask_numa_work()running is about 100 ms by default. So we can keep 1600 ms history by default ifNUMA_SCAN_NR_HISTis 16. If user choose to use smallersysctl_numa_balancing_scan_size, then we can only keep shorter history. In general, we want to keep no less than 1000 ms history. So 16 appears like a reasonable choice for us. Any other suggestion?
Quoted 1 line
This is very good information for Changelogs and comments :-)
Thanks! Will do this in the next version.
Best Regards,
Huang, Ying
RFC 9/10 autonuma, memory tiering: Double hot threshold for write hint page fault
In reply to Huang, YingFrom: Huang Ying <[email protected]>
The write performance of PMEM is much worse than its read performance. So even if a write-mostly pages is colder than a read-mostly pages, it is usually better to put the write-mostly pages in DRAM and read-mostly pages in PMEM.
To give write-mostly pages more opportunity to be promoted to DRAM, in this patch, the hot threshold for write hint page fault is doubled (easier to be promoted).
--- include/linux/sched/numa_balancing.h | 1 + kernel/sched/fair.c | 2 ++ mm/memory.c | 3 +++ 3 files changed, 6 insertions(+)
include/linux/sched/numa_balancing.h +1 -0
@@ -15,6 +15,7 @@#define TNF_FAULT_LOCAL 0x08#define TNF_MIGRATE_FAIL 0x10#define TNF_YOUNG 0x20 +#define TNF_WRITE 0x40#ifdef CONFIG_NUMA_BALANCING extern void task_numa_fault (int last_node,int node,int pages,int flags);
kernel/sched/fair.c +2 -0
@@ -1513,6 +1513,8 @@ bool should_numa_migrate_memory(struct task_struct *p, struct page * page, threshold =msecs_to_jiffies ( sysctl_numa_balancing_hot_threshold); +if (flags &TNF_WRITE ) + threshold *=2 ; latency =numa_hint_fault_latency (p, addr);if (latency > threshold)return false;
mm/memory.c +3 -0
@@ -3729,6 +3729,9 @@ static vm_fault_t do_numa_page(struct vm_fault *vmf)if (pte_young (old_pte)) flags |=TNF_YOUNG ; +if (vmf->flags &FAULT_FLAG_WRITE ) + flags |=TNF_WRITE ; + page =vm_normal_page (vma, vmf->address, pte);if (!page) goto unmap_out;
Signature · 1 line
2.23.0
RFC 10/10 autonuma, memory tiering: Adjust hot threshold automatically
In reply to Huang, YingFrom: Huang Ying <[email protected]>
It 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, that is, the page is the candidate promotion page.
If the number of the candidate promotion pages in the statistics interval is much higher than the promotion rate limit, the hot threshold will be lowered to reduce the number of the candidate promotion pages. Otherwise, the hot threshold will be raised 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 5.5% with 24.6% 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 | 48 ++++++++++++++++++++++++++++++++++++++---- 2 files changed, 47 insertions(+), 4 deletions(-)
include/linux/mmzone.h +3 -0
@@ -772,6 +772,9 @@ typedef struct pglist_data {#ifdef CONFIG_NUMA_BALANCING unsigned long autonuma_jiffies;unsigned long autonuma_try_migrate; +unsigned long autonuma_threshold_jiffies; +unsigned long autonuma_threshold_try_migrate; +unsigned long autonuma_threshold;#endif /* Fields commonly accessed by the page reclaim scanner */ struct lruvec lruvec;
kernel/sched/fair.c +44 -4
73 lines not on this page · raw message
Signature · 1 line
2.23.0
Peter Zijlstra
maintainerRe: [RFC 10/10] autonuma, memory tiering: Adjust hot threshold automatically
Quoted 13 lines · Ying
kernel/sched/fair.c +5
-0@@ -1486,6 +1486,41 @@ 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_threshold)
kernel/sched/fair.c static bool numa_migration_check_rate_limit(struct pglist_data *pgdat, · line 1503
Quoted 10 lines
kernel/sched/fair.c +10
-0+{ +unsigned long now = jiffies, last_threshold_jiffies; +unsigned long unit_threshold, threshold; +unsigned long try_migrate, ref_try_migrate, mdiff; + + last_threshold_jiffies = pgdat->autonuma_threshold_jiffies; +if (now > last_threshold_jiffies + +msecs_to_jiffies (sysctl_numa_balancing_scan_period_max) && +cmpxchg (&pgdat->autonuma_threshold_jiffies, + last_threshold_jiffies, now) == last_threshold_jiffies) {
That is seriously unreadable gunk.
Quoted 5 lines
kernel/sched/fair.c +5
-0+ + ref_try_migrate = rate_limit * + sysctl_numa_balancing_scan_period_max /1000 ; + try_migrate =node_page_state (pgdat,NUMA_TRY_MIGRATE ); + mdiff = try_migrate - pgdat->autonuma_threshold_try_migrate;
kernel/sched/fair.c static bool numa_migration_check_rate_limit(struct pglist_data *pgdat, · line 1518
Quoted 10 lines
kernel/sched/fair.c +10
-0+ unit_threshold = ref_threshold /NUMA_MIGRATION_ADJUST_STEPS ; + threshold = pgdat->autonuma_threshold; +if (!threshold) + threshold = ref_threshold; +if (mdiff > ref_try_migrate *11 /10 ) + threshold =max (threshold - unit_threshold, + unit_threshold); +else if (mdiff < ref_try_migrate *9 /10 ) + threshold =min (threshold + unit_threshold, + ref_threshold);
And that is violating codingstyle.
kernel/sched/fair.c static bool numa_migration_check_rate_limit(struct pglist_data *pgdat, · line 1522
Quoted 4 lines
kernel/sched/fair.c +4
-0+ pgdat->autonuma_threshold_try_migrate = try_migrate; + pgdat->autonuma_threshold = threshold; + } +}
Maybe if you use variable names that are slightly shorter than half your line length?
Re: [RFC 10/10] autonuma, memory tiering: Adjust hot threshold automatically
Quoted 19 lines · Peter Zijlstra
Quoted 17 lines · Ying
kernel/sched/fair.c +9
-0@@ -1486,6 +1486,41 @@ 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_threshold) +{ +unsigned long now = jiffies, last_threshold_jiffies; +unsigned long unit_threshold, threshold; +unsigned long try_migrate, ref_try_migrate, mdiff;
Quoted 8 lines
kernel/sched/fair.c static bool numa_migration_check_rate_limit(struct pglist_data *pgdat, · line 1503
Quoted 6 lines
kernel/sched/fair.c +6
-0+ + last_threshold_jiffies = pgdat->autonuma_threshold_jiffies; +if (now > last_threshold_jiffies + +msecs_to_jiffies (sysctl_numa_balancing_scan_period_max) && +cmpxchg (&pgdat->autonuma_threshold_jiffies, + last_threshold_jiffies, now) == last_threshold_jiffies) {That is seriously unreadable gunk.
The basic idea here is to adjust hot threshold every sysctl_numa_balancing_scan_period_max. Because the application accessing pattern may have spatial locality, and autonuma scans address space linearly. In general, the statistics of NUMA hint page fault latency isn't stable in arbitrary internal (such as 1 s, or 200 ms, etc). But the scanning of the whole address space of the application is expected to be finished within sysctl_numa_balancing_scan_period_max. The statistics of NUMA hint page fault latency is expected to be much more stable for the whole application. So we choose to adjust hot threshold every sysctl_numa_balancing_scan_period_max.
I will add comments for this in the next version.
Quoted 9 lines
Quoted 9 lines
kernel/sched/fair.c +9
-0+ + ref_try_migrate = rate_limit * + sysctl_numa_balancing_scan_period_max /1000 ; + try_migrate =node_page_state (pgdat,NUMA_TRY_MIGRATE ); + mdiff = try_migrate - pgdat->autonuma_threshold_try_migrate; + unit_threshold = ref_threshold /NUMA_MIGRATION_ADJUST_STEPS ; + threshold = pgdat->autonuma_threshold; +if (!threshold) + threshold = ref_threshold;
Quoted 8 lines
kernel/sched/fair.c static bool numa_migration_check_rate_limit(struct pglist_data *pgdat, · line 1518
Quoted 6 lines
kernel/sched/fair.c +6
-0+if (mdiff > ref_try_migrate *11 /10 ) + threshold =max (threshold - unit_threshold, + unit_threshold); +else if (mdiff < ref_try_migrate *9 /10 ) + threshold =min (threshold + unit_threshold, + ref_threshold);And that is violating codingstyle.
You mean I need to use braces here?
Quoted 8 lines
kernel/sched/fair.c static bool numa_migration_check_rate_limit(struct pglist_data *pgdat, · line 1522
Quoted 4 lines
kernel/sched/fair.c +4
-0+ pgdat->autonuma_threshold_try_migrate = try_migrate; + pgdat->autonuma_threshold = threshold; + } +}Maybe if you use variable names that are slightly shorter than half your line length?
Sure. I will use shorter variable name in the next version.
Best Regards,
Huang, Ying
Peter Zijlstra
maintainerRe: [RFC 10/10] autonuma, memory tiering: Adjust hot threshold automatically
Quoted 30 lines · Ying
Quoted 19 lines · Peter Zijlstra
Quoted 17 lines · Ying
kernel/sched/fair.c +9
-0@@ -1486,6 +1486,41 @@ 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_threshold) +{ +unsigned long now = jiffies, last_threshold_jiffies; +unsigned long unit_threshold, threshold; +unsigned long try_migrate, ref_try_migrate, mdiff;Quoted 8 lines
kernel/sched/fair.c static bool numa_migration_check_rate_limit(struct pglist_data *pgdat, · line 1503
Quoted 6 lines
kernel/sched/fair.c +6
-0+ + last_threshold_jiffies = pgdat->autonuma_threshold_jiffies; +if (now > last_threshold_jiffies + +msecs_to_jiffies (sysctl_numa_balancing_scan_period_max) && +cmpxchg (&pgdat->autonuma_threshold_jiffies, + last_threshold_jiffies, now) == last_threshold_jiffies) {That is seriously unreadable gunk.
Quoted 1 line
The basic idea here is to adjust hot threshold every
Oh, I figured out what it does, but it's just really hard to read because of those silly variable names.
This was just a first quick read through of the patches, and stuff like this annoys me no end. I did start a rewrite with more sensible variable names, but figured this might not be time for that.
I still need to think and review the whole concept in more detail, now that I've read the patches. But I need to chase regressions first :/
FWIW, can you post a SLIT / NUMA distance table for such a system?
Re: [RFC 10/10] autonuma, memory tiering: Adjust hot threshold automatically
Quoted 31 lines · Peter Zijlstra
Quoted 30 lines · Ying
Quoted 27 lines · Peter Zijlstra
Quoted 13 lines · Ying
kernel/sched/fair.c +5
-0@@ -1486,6 +1486,41 @@ 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_threshold)kernel/sched/fair.c static bool numa_migration_check_rate_limit(struct pglist_data *pgdat, · line 1503
Quoted 10 lines
kernel/sched/fair.c +10
-0+{ +unsigned long now = jiffies, last_threshold_jiffies; +unsigned long unit_threshold, threshold; +unsigned long try_migrate, ref_try_migrate, mdiff; + + last_threshold_jiffies = pgdat->autonuma_threshold_jiffies; +if (now > last_threshold_jiffies + +msecs_to_jiffies (sysctl_numa_balancing_scan_period_max) && +cmpxchg (&pgdat->autonuma_threshold_jiffies, + last_threshold_jiffies, now) == last_threshold_jiffies) {That is seriously unreadable gunk.
Quoted 8 lines
Quoted 1 line
The basic idea here is to adjust hot threshold every
Oh, I figured out what it does, but it's just really hard to read because of those silly variable names.
This was just a first quick read through of the patches, and stuff like this annoys me no end. I did start a rewrite with more sensible variable names, but figured this might not be time for that.
Sorry about the poor naming. That is always hard for me.
Quoted 2 lines
I still need to think and review the whole concept in more detail, now that I've read the patches. But I need to chase regressions first :/
Thanks for your help!
Quoted 1 line
FWIW, can you post a SLIT / NUMA distance table for such a system?
Sure. Will send you as attachment in another email.
Best Regards,
Huang, Ying
Re: [RFC 10/10] autonuma, memory tiering: Adjust hot threshold automatically
In reply to Peter ZijlstraHi, Peter,
Quoted 2 lines · Peter Zijlstra
I still need to think and review the whole concept in more detail, now that I've read the patches. But I need to chase regressions first :/
Have you found some time to review the concept?
Just want to check the status. Please don't regard this as pushing.
Best Regards,
Huang, Ying