sched_ext: Enhance built-in idle selection with allowed CPUs
Subsystems (3)
Andrea Righi
reviewerPATCH v7 1/1 sched_ext: Enhance built-in idle selection with allowed CPUs
Many scx schedulers implement their own hard or soft-affinity rules to support topology characteristics, such as heterogeneous architectures (e.g., big.LITTLE, P-cores/E-cores), or to categorize tasks based on specific properties (e.g., running certain tasks only in a subset of CPUs).
Currently, there is no mechanism that allows to use the built-in idle CPU selection policy to an arbitrary subset of CPUs. As a result, schedulers often implement their own idle CPU selection policies, which are typically similar to one another, leading to a lot of code duplication.
To address this, extend the built-in idle CPU selection policy introducing the concept of allowed CPUs.
With this concept, BPF schedulers can apply the built-in idle CPU selection policy to a subset of allowed CPUs, allowing them to implement their own hard/soft-affinity rules while still using the topology optimizations of the built-in policy, preventing code duplication across different schedulers.
To implement this introduce a new helper kfunc scx_bpf_select_cpu_and() that accepts a cpumask of allowed CPUs:
s32 scx_bpf_select_cpu_and(struct task_struct *p, s32 prev_cpu,
u64 wake_flags, const struct cpumask *cpus_allowed, u64 flags);
Example usage
=============
s32 BPF_STRUCT_OPS(foo_select_cpu, struct task_struct *p,
s32 prev_cpu, u64 wake_flags)
{
const struct cpumask *cpus = task_allowed_cpus(p) ?: p->cpus_ptr;
s32 cpu;
cpu = scx_bpf_select_cpu_and(p, prev_cpu, wake_flags, cpus, 0);
if (cpu >= 0) {
scx_bpf_dsq_insert(p, SCX_DSQ_LOCAL, SCX_SLICE_DFL, 0);
return cpu;
}
return prev_cpu;
}Results
=======
Load distribution on a 4 sockets / 4 cores per socket system, simulated using virtme-ng, running a modified version of scx_bpfland that uses the new helper scx_bpf_select_cpu_and() and 0xff00 as allowed domain:
$ vng --cpu 16,sockets=4,cores=4,threads=1
...
$ stress-ng -c 16
...
$ htop
...
0[ 0.0%] 8[||||||||||||||||||||||||100.0%]
1[ 0.0%] 9[||||||||||||||||||||||||100.0%]
2[ 0.0%] 10[||||||||||||||||||||||||100.0%]
3[ 0.0%] 11[||||||||||||||||||||||||100.0%]
4[ 0.0%] 12[||||||||||||||||||||||||100.0%]
5[ 0.0%] 13[||||||||||||||||||||||||100.0%]
6[ 0.0%] 14[||||||||||||||||||||||||100.0%]
7[ 0.0%] 15[||||||||||||||||||||||||100.0%]With scx_bpf_select_cpu_dfl() tasks would be distributed evenly across all the available CPUs.
ChangeLog v6 -> v7:
- use NULL instead of p->cpus_ptr when the caller doesn't specify an additional "and" cpumask
- handle per-CPU tasks in scx_bpf_select_cpu_and(): since this API can be called also from ops.enqueue(), per-CPU tasks are not excluded
- if prev_cpu isn't in the allowed CPUs, skip optimizations and try to pick any idle CPU in the subsets of allowed CPUs
- do not deprecate scx_bpf_select_cpu_dfl(), as there's no need to convert everyone to use the new scx_bpf_select_cpu_and() API
ChangeLog v5 -> v6:
- prevent redundant cpumask_subset() + cpumask_equal() checks in all patches
- remove cpumask_subset() + cpumask_and() combo with local cpumasks, as cpumask_and() alone is generally more efficient
- cleanup patches to prevent unnecessary function renames
ChangeLog v4 -> v5:
- simplify code to compute the temporary task's cpumasks (and)
ChangeLog v3 -> v4:
- keep p->nr_cpus_allowed optimizations (skip cpumask operations when the task can run on all CPUs)
- allow to call scx_bpf_select_cpu_and() also from ops.enqueue() and modify the kselftest to cover this case as well
- rebase to the latest sched_ext/for-6.15
ChangeLog v2 -> v3:
- incrementally refactor scx_select_cpu_dfl() to accept idle flags and an arbitrary allowed cpumask
- build scx_bpf_select_cpu_and() on top of the existing logic
- re-arrange scx_select_cpu_dfl() prototype, aligning the first three arguments with select_task_rq()
- do not use "domain" for the allowed cpumask to avoid potential ambiguity with sched_domain
ChangeLog v1 -> v2:
- rename scx_bpf_select_cpu_pref() to scx_bpf_select_cpu_and() and always select idle CPUs strictly within the allowed domain
- rename preferred CPUs -> allowed CPU
- drop %SCX_PICK_IDLE_IN_PREF (not required anymore)
- deprecate scx_bpf_select_cpu_dfl() in favor of scx_bpf_select_cpu_and() and provide all the required backward compatibility boilerplate
Andrea Righi (5):
sched_ext: idle: Extend topology optimizations to all tasks
sched_ext: idle: Explicitly pass allowed cpumask to scx_select_cpu_dfl()
sched_ext: idle: Accept an arbitrary cpumask in scx_select_cpu_dfl()
sched_ext: idle: Introduce scx_bpf_select_cpu_and() selftests/sched_ext: Add test for scx_bpf_select_cpu_and()
kernel/sched/ext.c | 3 +- kernel/sched/ext_idle.c | 188 +++++++++++++++++---- kernel/sched/ext_idle.h | 3 +- tools/sched_ext/include/scx/common.bpf.h | 2 + tools/testing/selftests/sched_ext/Makefile | 1 + .../testing/selftests/sched_ext/allowed_cpus.bpf.c | 121 +++++++++++++ tools/testing/selftests/sched_ext/allowed_cpus.c | 57 +++++++ 7 files changed, 342 insertions(+), 33 deletions(-) create mode 100644 tools/testing/selftests/sched_ext/allowed_cpus.bpf.c create mode 100644 tools/testing/selftests/sched_ext/allowed_cpus.c
Andrea Righi
reviewerPATCH 1/5 sched_ext: idle: Extend topology optimizations to all tasks
The built-in idle selection policy, scx_select_cpu_dfl(), always prioritizes picking idle CPUs within the same LLC or NUMA node, but these optimizations are currently applied only when a task has no CPU affinity constraints.
This is done primarily for efficiency, as it avoids the overhead of updating a cpumask every time we need to select an idle CPU (which can be costly in large SMP systems).
However, this approach limits the effectiveness of the built-in idle policy and results in inconsistent behavior, as affinity-restricted tasks don't benefit from topology-aware optimizations.
To address this, modify the policy to apply LLC and NUMA-aware optimizations even when a task is constrained to a subset of CPUs.
We can still avoid updating the cpumasks by checking if the subset of LLC and node CPUs are contained in the subset of allowed CPUs usable by the task (which is true in most of the cases - for tasks that don't have affinity constratints).
Moreover, use temporary local per-CPU cpumasks to determine the LLC and node subsets, minimizing potential overhead even on large SMP systems.
--- kernel/sched/ext_idle.c | 73 ++++++++++++++++++++++++++++------------- 1 file changed, 51 insertions(+), 22 deletions(-)
kernel/sched/ext_idle.c +51 -22
@@ -46,6 +46,12 @@ static struct scx_idle_cpus scx_idle_global_masks;*/ static struct scx_idle_cpus **scx_idle_node_masks; +/* +* Local per-CPU cpumasks (used to generate temporary idle cpumasks). +*/ +static DEFINE_PER_CPU(cpumask_var_t, local_llc_idle_cpumask); +static DEFINE_PER_CPU(cpumask_var_t, local_numa_idle_cpumask); +/* * Return the idle masks associated to a target @node. *
@@ -391,6 +397,14 @@ void scx_idle_update_selcpu_topology(struct sched_ext_ops *ops)static_branch_disable_cpuslocked (&scx_selcpu_topo_numa); } +/* +* Return true if @p can run on all possible CPUs, false otherwise. +*/ +static inline bool task_affinity_all (const struct task_struct *p) +{ +return p->nr_cpus_allowed >=num_possible_cpus (); +} +/* * Built-in CPU idle selection policy: *
@@ -426,8 +440,7 @@ void scx_idle_update_selcpu_topology(struct sched_ext_ops *ops)*/ s32 scx_select_cpu_dfl (struct task_struct *p,s32 prev_cpu,u64 wake_flags,u64 flags) { -const struct cpumask *llc_cpus =NULL ; -const struct cpumask *numa_cpus =NULL ; +const struct cpumask *llc_cpus =NULL , *numa_cpus =NULL ;int node =scx_cpu_node_if_enabled (prev_cpu);s32 cpu;
@@ -437,22 +450,30 @@ s32 scx_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, u64 wake_flags, u64rcu_read_lock ();/* -* Determine the scheduling domain only if the task is allowed to run -* on all CPUs. +* Determine the subset of CPUs that the task can use in its +* current LLC and node. * -* This is done primarily for efficiency, as it avoids the overhead of -* updating a cpumask every time we need to select an idle CPU (which -* can be costly in large SMP systems), but it also aligns logically: -* if a task's scheduling domain is restricted by user-space (through -* CPU affinity), the task will simply use the flat scheduling domain -* defined by user-space. +* If the task can run on all CPUs, use the node and LLC cpumasks +* directly. */ -if (p->nr_cpus_allowed >=num_possible_cpus ()) { -if (static_branch_maybe (CONFIG_NUMA , &scx_selcpu_topo_numa)) - numa_cpus =numa_span (prev_cpu); +if (static_branch_maybe (CONFIG_NUMA , &scx_selcpu_topo_numa)) { +struct cpumask *local_cpus =this_cpu_cpumask_var_ptr (local_numa_idle_cpumask); +const struct cpumask *cpus =numa_span (prev_cpu); + +if (task_affinity_all (p)) + numa_cpus = cpus; +else if (cpus &&cpumask_and (local_cpus, p->cpus_ptr, cpus)) + numa_cpus = local_cpus; + } -if (static_branch_maybe (CONFIG_SCHED_MC , &scx_selcpu_topo_llc)) - llc_cpus =llc_span (prev_cpu); +if (static_branch_maybe (CONFIG_SCHED_MC , &scx_selcpu_topo_llc)) { +struct cpumask *local_cpus =this_cpu_cpumask_var_ptr (local_llc_idle_cpumask); +const struct cpumask *cpus =llc_span (prev_cpu); + +if (task_affinity_all (p)) + llc_cpus = cpus; +else if (cpus &&cpumask_and (local_cpus, p->cpus_ptr, cpus)) + llc_cpus = local_cpus; }/*
@@ -596,7 +617,7 @@ s32 scx_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, u64 wake_flags, u64*/ void scx_idle_init_masks (void ) { -int node; +int i;/* Allocate global idle cpumasks */ BUG_ON (!alloc_cpumask_var (&scx_idle_global_masks.cpu,GFP_KERNEL ));
@@ -607,13 +628,21 @@ void scx_idle_init_masks(void) sizeof(*scx_idle_node_masks), GFP_KERNEL);BUG_ON (!scx_idle_node_masks); -for_each_node (node) { - scx_idle_node_masks[node] =kzalloc_node (sizeof (**scx_idle_node_masks), -GFP_KERNEL , node); -BUG_ON (!scx_idle_node_masks[node]); +for_each_node (i) { + scx_idle_node_masks[i] =kzalloc_node (sizeof (**scx_idle_node_masks), +GFP_KERNEL , i); +BUG_ON (!scx_idle_node_masks[i]); + +BUG_ON (!alloc_cpumask_var_node (&scx_idle_node_masks[i]->cpu,GFP_KERNEL , i)); +BUG_ON (!alloc_cpumask_var_node (&scx_idle_node_masks[i]->smt,GFP_KERNEL , i)); + } -BUG_ON (!alloc_cpumask_var_node (&scx_idle_node_masks[node]->cpu,GFP_KERNEL , node)); -BUG_ON (!alloc_cpumask_var_node (&scx_idle_node_masks[node]->smt,GFP_KERNEL , node)); +/* Allocate local per-cpu idle cpumasks */ +for_each_possible_cpu (i) { +BUG_ON (!alloc_cpumask_var_node (&per_cpu (local_llc_idle_cpumask, i), +GFP_KERNEL ,cpu_to_node (i))); +BUG_ON (!alloc_cpumask_var_node (&per_cpu (local_numa_idle_cpumask, i), +GFP_KERNEL ,cpu_to_node (i))); } }
Signature · 1 line
2.49.0
Andrea Righi
reviewerPATCH 2/5 sched_ext: idle: Explicitly pass allowed cpumask to scx_select_cpu_dfl()
In reply to Andrea RighiModify scx_select_cpu_dfl() to take the allowed cpumask as an explicit argument, instead of implicitly using @p->cpus_ptr.
This prepares for future changes where arbitrary cpumasks may be passed to the built-in idle CPU selection policy.
This is a pure refactoring with no functional changes.
--- kernel/sched/ext.c | 2 +- kernel/sched/ext_idle.c | 20 +++++++++++--------- kernel/sched/ext_idle.h | 3 ++- 3 files changed, 14 insertions(+), 11 deletions(-)
kernel/sched/ext.c +1 -1
@@ -3392,7 +3392,7 @@ static int select_task_rq_scx(struct task_struct *p, int prev_cpu, int wake_flag }else {s32 cpu; - cpu =scx_select_cpu_dfl (p, prev_cpu, wake_flags,0 ); + cpu =scx_select_cpu_dfl (p, prev_cpu, wake_flags,NULL ,0 );if (cpu >=0 ) { p->scx.slice =SCX_SLICE_DFL ; p->scx.ddsp_dsq_id =SCX_DSQ_LOCAL ;
kernel/sched/ext_idle.c +11 -9
@@ -438,9 +438,11 @@ static inline bool task_affinity_all(const struct task_struct *p)* NOTE: tasks that can only run on 1 CPU are excluded by this logic, because * we never call ops.select_cpu() for them, see select_task_rq(). */ -s32 scx_select_cpu_dfl (struct task_struct *p,s32 prev_cpu,u64 wake_flags,u64 flags) +s32 scx_select_cpu_dfl (struct task_struct *p,s32 prev_cpu,u64 wake_flags, +const struct cpumask *cpus_allowed,u64 flags) {const struct cpumask *llc_cpus =NULL , *numa_cpus =NULL ; +const struct cpumask *allowed = cpus_allowed ?: p->cpus_ptr;int node =scx_cpu_node_if_enabled (prev_cpu);s32 cpu;
@@ -460,9 +462,9 @@ s32 scx_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, u64 wake_flags, u64struct cpumask *local_cpus =this_cpu_cpumask_var_ptr (local_numa_idle_cpumask);const struct cpumask *cpus =numa_span (prev_cpu); -if (task_affinity_all (p)) +if (allowed == p->cpus_ptr &&task_affinity_all (p)) numa_cpus = cpus; -else if (cpus &&cpumask_and (local_cpus, p->cpus_ptr, cpus)) +else if (cpus &&cpumask_and (local_cpus, allowed, cpus)) numa_cpus = local_cpus; }
@@ -470,9 +472,9 @@ s32 scx_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, u64 wake_flags, u64struct cpumask *local_cpus =this_cpu_cpumask_var_ptr (local_llc_idle_cpumask);const struct cpumask *cpus =llc_span (prev_cpu); -if (task_affinity_all (p)) +if (allowed == p->cpus_ptr &&task_affinity_all (p)) llc_cpus = cpus; -else if (cpus &&cpumask_and (local_cpus, p->cpus_ptr, cpus)) +else if (cpus &&cpumask_and (local_cpus, allowed, cpus)) llc_cpus = local_cpus; }
@@ -511,7 +513,7 @@ s32 scx_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, u64 wake_flags, u64 cpu_rq(cpu)->scx.local_dsq.nr == 0 && (!(flags & SCX_PICK_IDLE_IN_NODE) || (waker_node == node)) && !cpumask_empty(idle_cpumask(waker_node)->cpu)) { -if (cpumask_test_cpu (cpu, p->cpus_ptr)) +if (cpumask_test_cpu (cpu, allowed)) goto out_unlock; } }
@@ -556,7 +558,7 @@ s32 scx_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, u64 wake_flags, u64* begin in prev_cpu's node and proceed to other nodes in * order of increasing distance. */ - cpu =scx_pick_idle_cpu (p->cpus_ptr, node, flags |SCX_PICK_IDLE_CORE ); + cpu =scx_pick_idle_cpu (allowed, node, flags |SCX_PICK_IDLE_CORE );if (cpu >=0 ) goto out_unlock;
@@ -604,7 +606,7 @@ s32 scx_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, u64 wake_flags, u64* in prev_cpu's node and proceed to other nodes in order of * increasing distance. */ - cpu =scx_pick_idle_cpu (p->cpus_ptr, node, flags); + cpu =scx_pick_idle_cpu (allowed, node, flags); out_unlock:rcu_read_unlock ();
@@ -858,7 +860,7 @@ __bpf_kfunc s32 scx_bpf_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, goto prev_cpu;#ifdef CONFIG_SMP - cpu =scx_select_cpu_dfl (p, prev_cpu, wake_flags,0 ); + cpu =scx_select_cpu_dfl (p, prev_cpu, wake_flags,NULL ,0 );if (cpu >=0 ) { *is_idle = true;return cpu;
kernel/sched/ext_idle.h +2 -1
@@ -27,7 +27,8 @@ static inline s32 scx_pick_idle_cpu(const struct cpumask *cpus_allowed, int node }#endif /* CONFIG_SMP */ -s32 scx_select_cpu_dfl (struct task_struct *p,s32 prev_cpu,u64 wake_flags,u64 flags); +s32 scx_select_cpu_dfl (struct task_struct *p,s32 prev_cpu,u64 wake_flags, +const struct cpumask *cpus_allowed,u64 flags);void scx_idle_enable (struct sched_ext_ops *ops);void scx_idle_disable (void );int scx_idle_init (void );
Signature · 1 line
2.49.0
Andrea Righi
reviewerPATCH 3/5 sched_ext: idle: Accept an arbitrary cpumask in scx_select_cpu_dfl()
In reply to Andrea RighiMany scx schedulers implement their own hard or soft-affinity rules to support topology characteristics, such as heterogeneous architectures (e.g., big.LITTLE, P-cores/E-cores), or to categorize tasks based on specific properties (e.g., running certain tasks only in a subset of CPUs).
Currently, there is no mechanism that allows to use the built-in idle CPU selection policy to an arbitrary subset of CPUs. As a result, schedulers often implement their own idle CPU selection policies, which are typically similar to one another, leading to a lot of code duplication.
To address this, modify scx_select_cpu_dfl() to accept an arbitrary cpumask, that can be used by the BPF schedulers to apply the existent built-in idle CPU selection policy to a subset of allowed CPUs.
With this concept the idle CPU selection policy becomes the following:
- always prioritize CPUs from fully idle SMT cores (if SMT is enabled),
- select the same CPU if it's idle and in the allowed CPUs,
- select an idle CPU within the same LLC, if the LLC cpumask is a subset of the allowed CPUs,
- select an idle CPU within the same node, if the node cpumask is a subset of the allowed CPUs,
- select an idle CPU within the allowed CPUs.
This functionality will be exposed through a dedicated kfunc in a separate patch.
--- kernel/sched/ext_idle.c | 48 +++++++++++++++++++++++++++++++++++++---- 1 file changed, 44 insertions(+), 4 deletions(-)
kernel/sched/ext_idle.c +44 -4
@@ -49,6 +49,7 @@ static struct scx_idle_cpus **scx_idle_node_masks;/* * Local per-CPU cpumasks (used to generate temporary idle cpumasks). */ +static DEFINE_PER_CPU(cpumask_var_t, local_idle_cpumask); static DEFINE_PER_CPU(cpumask_var_t, local_llc_idle_cpumask); static DEFINE_PER_CPU(cpumask_var_t, local_numa_idle_cpumask);
@@ -417,13 +418,15 @@ static inline bool task_affinity_all(const struct task_struct *p)* branch prediction optimizations. * * 3. Pick a CPU within the same LLC (Last-Level Cache): -* - if the above conditions aren't met, pick a CPU that shares the same LLC -* to maintain cache locality. +* - if the above conditions aren't met, pick a CPU that shares the same +* LLC, if the LLC domain is a subset of @cpus_allowed, to maintain +* cache locality. * * 4. Pick a CPU within the same NUMA node, if enabled: -* - choose a CPU from the same NUMA node to reduce memory access latency. +* - choose a CPU from the same NUMA node, if the node cpumask is a +* subset of @cpus_allowed, to reduce memory access latency. * -* 5. Pick any idle CPU usable by the task. +* 5. Pick any idle CPU within the @cpus_allowed domain. * * Step 3 and 4 are performed only if the system has, respectively, * multiple LLCs / multiple NUMA nodes (see scx_selcpu_topo_llc and
@@ -446,6 +449,39 @@ s32 scx_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, u64 wake_flags,int node =scx_cpu_node_if_enabled (prev_cpu);s32 cpu; +preempt_disable (); + +/* +* Determine the subset of CPUs usable by @p within @cpus_allowed. +*/ +if (allowed != p->cpus_ptr) { +struct cpumask *local_cpus =this_cpu_cpumask_var_ptr (local_idle_cpumask); + +if (task_affinity_all (p)) { + allowed = cpus_allowed; + }else if (cpumask_and (local_cpus, cpus_allowed, p->cpus_ptr)) { + allowed = local_cpus; + }else { + cpu = -EBUSY ; + goto out_enable; + } + +/* +* If @prev_cpu is not in the allowed CPUs, skip topology +* optimizations and try to pick any idle CPU usable by the +* task. +* +* If %SCX_OPS_BUILTIN_IDLE_PER_NODE is enabled, prioritize +* the current node, as it may optimize some waker->wakee +* workloads. +*/ +if (!cpumask_test_cpu (prev_cpu, allowed)) { + node =scx_cpu_node_if_enabled (smp_processor_id ()); + cpu =scx_pick_idle_cpu (allowed, node, flags); + goto out_enable; + } + } +/* * This is necessary to protect llc_cpus. */
@@ -610,6 +646,8 @@ s32 scx_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, u64 wake_flags, out_unlock:rcu_read_unlock (); +out_enable: +preempt_enable ();return cpu; }
@@ -641,6 +679,8 @@ void scx_idle_init_masks(void)/* Allocate local per-cpu idle cpumasks */ for_each_possible_cpu(i) { + BUG_ON(!alloc_cpumask_var_node(&per_cpu(local_idle_cpumask, i), + GFP_KERNEL, cpu_to_node(i))); BUG_ON(!alloc_cpumask_var_node(&per_cpu(local_llc_idle_cpumask, i), GFP_KERNEL, cpu_to_node(i))); BUG_ON(!alloc_cpumask_var_node(&per_cpu(local_numa_idle_cpumask, i),
Signature · 1 line
2.49.0
Andrea Righi
reviewerPATCH 4/5 sched_ext: idle: Introduce scx_bpf_select_cpu_and()
In reply to Andrea RighiProvide a new kfunc, scx_bpf_select_cpu_and(), that can be used to apply the built-in idle CPU selection policy to a subset of allowed CPU.
This new helper is basically an extension of scx_bpf_select_cpu_dfl(). However, when an idle CPU can't be found, it returns a negative value instead of @prev_cpu, aligning its behavior more closely with scx_bpf_pick_idle_cpu().
It also accepts %SCX_PICK_IDLE_* flags, which can be used to enforce strict selection to @prev_cpu's node (%SCX_PICK_IDLE_IN_NODE), or to request only a full-idle SMT core (%SCX_PICK_IDLE_CORE), while applying the built-in selection logic.
With this helper, BPF schedulers can apply the built-in idle CPU selection policy restricted to any arbitrary subset of CPUs.
Example usage
=============
Possible usage in ops.select_cpu():
s32 BPF_STRUCT_OPS(foo_select_cpu, struct task_struct *p,
s32 prev_cpu, u64 wake_flags)
{
const struct cpumask *cpus = task_allowed_cpus(p) ?: p->cpus_ptr;
s32 cpu;
cpu = scx_bpf_select_cpu_and(p, prev_cpu, wake_flags, cpus, 0);
if (cpu >= 0) {
scx_bpf_dsq_insert(p, SCX_DSQ_LOCAL, SCX_SLICE_DFL, 0);
return cpu;
}
return prev_cpu;
}Results
=======
Load distribution on a 4 sockets, 4 cores per socket system, simulated using virtme-ng, running a modified version of scx_bpfland that uses scx_bpf_select_cpu_and() with 0xff00 as the allowed subset of CPUs:
$ vng --cpu 16,sockets=4,cores=4,threads=1 ... $ stress-ng -c 16 ... $ htop ... 0[ 0.0%] 8[||||||||||||||||||||||||100.0%] 1[ 0.0%] 9[||||||||||||||||||||||||100.0%] 2[ 0.0%] 10[||||||||||||||||||||||||100.0%] 3[ 0.0%] 11[||||||||||||||||||||||||100.0%] 4[ 0.0%] 12[||||||||||||||||||||||||100.0%] 5[ 0.0%] 13[||||||||||||||||||||||||100.0%] 6[ 0.0%] 14[||||||||||||||||||||||||100.0%] 7[ 0.0%] 15[||||||||||||||||||||||||100.0%]
With scx_bpf_select_cpu_dfl() tasks would be distributed evenly across all the available CPUs.
--- kernel/sched/ext.c | 1 + kernel/sched/ext_idle.c | 55 ++++++++++++++++++++++++ tools/sched_ext/include/scx/common.bpf.h | 2 + 3 files changed, 58 insertions(+)
kernel/sched/ext.c +1 -0
@@ -465,6 +465,7 @@ struct sched_ext_ops {* idle CPU tracking and the following helpers become unavailable: * * - scx_bpf_select_cpu_dfl() +* - scx_bpf_select_cpu_and() * - scx_bpf_test_and_clear_cpu_idle() * - scx_bpf_pick_idle_cpu() *
kernel/sched/ext_idle.c +55 -0
67 lines not on this page · raw message
tools/sched_ext/include/scx/common.bpf.h +2 -0
@@ -48,6 +48,8 @@ static inline void ___vmlinux_h_sanity_check___(void) s32 scx_bpf_create_dsq(u64 dsq_id, s32 node) __ksym; s32 scx_bpf_select_cpu_dfl(struct task_struct *p, s32 prev_cpu, u64 wake_flags, bool *is_idle) __ksym; +s32 scx_bpf_select_cpu_and(struct task_struct *p, s32 prev_cpu, u64 wake_flags, + const struct cpumask *cpus_allowed, u64 flags) __ksym __weak; void scx_bpf_dsq_insert(struct task_struct *p, u64 dsq_id, u64 slice, u64 enq_flags) __ksym __weak; void scx_bpf_dsq_insert_vtime(struct task_struct *p, u64 dsq_id, u64 slice, u64 vtime, u64 enq_flags) __ksym __weak; u32 scx_bpf_dispatch_nr_slots(void) __ksym;
Signature · 1 line
2.49.0
Andrea Righi
reviewerPATCH 5/5 selftests/sched_ext: Add test for scx_bpf_select_cpu_and()
In reply to Andrea RighiAdd a selftest to validate the behavior of the built-in idle CPU selection policy applied to a subset of allowed CPUs, using scx_bpf_select_cpu_and().
--- tools/testing/selftests/sched_ext/Makefile | 1 + .../selftests/sched_ext/allowed_cpus.bpf.c | 121 ++++++++++++++++++ .../selftests/sched_ext/allowed_cpus.c | 57 +++++++++ 3 files changed, 179 insertions(+) create mode 100644 tools/testing/selftests/sched_ext/allowed_cpus.bpf.c create mode 100644 tools/testing/selftests/sched_ext/allowed_cpus.c
tools/testing/selftests/sched_ext/Makefile +1 -0
@@ -173,6 +173,7 @@ auto-test-targets := \ maybe_null \ minimal \ numa \ + allowed_cpus \ prog_run \ reload_loop \ select_cpu_dfl \
tools/testing/selftests/sched_ext/allowed_cpus.bpf.c new file +121 -0
121 lines not on this page · raw message
tools/testing/selftests/sched_ext/allowed_cpus.c new file +57 -0
57 lines not on this page · raw message
Signature · 1 line
2.49.0
Quoted 19 lines · Andrea Righi
Many scx schedulers implement their own hard or soft-affinity rules to support topology characteristics, such as heterogeneous architectures (e.g., big.LITTLE, P-cores/E-cores), or to categorize tasks based on specific properties (e.g., running certain tasks only in a subset of CPUs).
Currently, there is no mechanism that allows to use the built-in idle CPU selection policy to an arbitrary subset of CPUs. As a result, schedulers often implement their own idle CPU selection policies, which are typically similar to one another, leading to a lot of code duplication.
To address this, extend the built-in idle CPU selection policy introducing the concept of allowed CPUs.
With this concept, BPF schedulers can apply the built-in idle CPU selection policy to a subset of allowed CPUs, allowing them to implement their own hard/soft-affinity rules while still using the topology optimizations of the built-in policy, preventing code duplication across different schedulers.
Quoted 5 lines
To implement this introduce a new helper kfunc
scx_bpf_select_cpu_and()that accepts a cpumask of allowed CPUs:s32 scx_bpf_select_cpu_and(struct
task_struct*p, s32prev_cpu,u64 wake_flags,
Applied to sched_ext/for-6.16.
Thanks!
Signature · 1 line
tejun