A-Team_Digital_Solutions/android_kernel_motorola_sm6375
Watch
2
0
Fork
You've already forked android_kernel_motorola_sm6375
 0
mirror of https://github.com/BobTheBlinker/android_kernel_motorola_sm6375.git synced 2026-10-28 10:41:38 -04:00
Code Issues Projects Releases Packages Wiki Activity

sched/numa: Select a preferred node with the most numa hinting faults

Browse source 
This patch selects a preferred node for a task to run on based on the
NUMA hinting faults. This information is later used to migrate tasks
towards the node during balancing.

Signed-off-by: Mel Gorman <[email protected]>
Reviewed-by: Rik van Riel <[email protected]>
Cc: Andrea Arcangeli <[email protected]>
Cc: Johannes Weiner <[email protected]>
Cc: Srikar Dronamraju <[email protected]>
Signed-off-by: Peter Zijlstra <[email protected]>
Link: http://lkml.kernel.org/r/[email protected]
Signed-off-by: Ingo Molnar <[email protected]>
This commit is contained in:
Mel Gorman 2013-10-07 11:28:58 +01:00 • committed by Ingo Molnar
commit 688b7585d1
3 changed files with 17 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

1
kernel/sched/core.c
View file

@ -1633,6 +1633,7 @@ static void __sched_fork(struct task_struct *p)
p->numa_scan_seq = p->mm ? p->mm->numa_scan_seq : 0;
p->numa_migrate_seq = p->mm ? p->mm->numa_scan_seq - 1 : 0;
p->numa_scan_period = sysctl_numa_balancing_scan_delay;
p->numa_preferred_nid = -1;
p->numa_work.next = &p->numa_work;
p->numa_faults = NULL;
#endif /* CONFIG_NUMA_BALANCING */

17
kernel/sched/fair.c
View file

@ -879,7 +879,8 @@ static unsigned int task_scan_max(struct task_struct *p)
static void task_numa_placement(struct task_struct *p)
{
int seq;
int seq, nid, max_nid = -1;
unsigned long max_faults = 0;
if (!p->mm) /* for example, ksmd faulting in a user's mm */
return;
@ -889,7 +890,19 @@ static void task_numa_placement(struct task_struct *p)
p->numa_scan_seq = seq;
p->numa_scan_period_max = task_scan_max(p);
/* FIXME: Scheduling placement policy hints go here */
/* Find the node with the highest number of faults */
for_each_online_node(nid) {
unsigned long faults = p->numa_faults[nid];
p->numa_faults[nid] >>= 1;
if (faults > max_faults) {
max_faults = faults;
max_nid = nid;
}
}
/* Update the tasks preferred node if necessary */
if (max_faults && max_nid != p->numa_preferred_nid)
p->numa_preferred_nid = max_nid;
}
/*