Message ID | 20200218082634.1596727-4-ying.huang@intel.com (mailing list archive) |
---|---|
State | New, archived |
Headers | show |
Series | autonuma: Optimize memory placement in memory tiering system | expand |
On Tue, Feb 18, 2020 at 04:26:29PM +0800, Huang, Ying wrote: > From: Huang Ying <ying.huang@intel.com> > > 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. > > Signed-off-by: "Huang, Ying" <ying.huang@intel.com> Unfortunately I stopped reading at this point. It depends on another series entirely and they really need to be presented together instead of relying on searching mail archives to find other patches to try assemble the full picture :(. Ideally each stage would have supporting data showing roughly how it behaves at each major stage. I know this will be a pain but the original NUMA balancing had the same problem and ultimately started with one large series that got the basics right followed by other series that improved it in stages. That process is *still* ongoing today.
Mel Gorman <mgorman@suse.de> writes: > On Tue, Feb 18, 2020 at 04:26:29PM +0800, Huang, Ying wrote: >> From: Huang Ying <ying.huang@intel.com> >> >> 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. >> >> Signed-off-by: "Huang, Ying" <ying.huang@intel.com> > > Unfortunately I stopped reading at this point. It depends on another series > entirely and they really need to be presented together instead of relying > on searching mail archives to find other patches to try assemble the full > picture :(. Ideally each stage would have supporting data showing roughly > how it behaves at each major stage. I know this will be a pain but the > original NUMA balancing had the same problem and ultimately started with > one large series that got the basics right followed by other series that > improved it in stages. That process is *still* ongoing today. Sorry for inconvenience, we will post a new patchset including both series and add supporting data at each major stage when possible. Best Regards, Huang, Ying
diff --git a/mm/migrate.c b/mm/migrate.c index 0b046759f99a..bbf16764d105 100644 --- a/mm/migrate.c +++ b/mm/migrate.c @@ -48,6 +48,7 @@ #include <linux/page_owner.h> #include <linux/sched/mm.h> #include <linux/ptrace.h> +#include <linux/sched/sysctl.h> #include <asm/tlbflush.h> @@ -1946,8 +1947,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; @@ -1958,12 +1958,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; } @@ -1990,8 +1987,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, compound_nr(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; diff --git a/mm/vmscan.c b/mm/vmscan.c index fe90236045d5..b265868d62ef 100644 --- a/mm/vmscan.c +++ b/mm/vmscan.c @@ -57,6 +57,7 @@ #include <linux/swapops.h> #include <linux/balloon_compaction.h> +#include <linux/sched/sysctl.h> #include "internal.h" @@ -3462,8 +3463,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. @@ -3475,6 +3479,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; }