Commit | Line | Data |
---|---|---|
51e0304c IM |
1 | /* |
2 | * Only give sleepers 50% of their service deficit. This allows | |
3 | * them to run sooner, but does not allow tons of sleepers to | |
4 | * rip the spread apart. | |
5 | */ | |
f8b6d1cc | 6 | SCHED_FEAT(GENTLE_FAIR_SLEEPERS, true) |
e26af0e8 | 7 | |
e26af0e8 PZ |
8 | /* |
9 | * Place new tasks ahead so that they do not starve already running | |
10 | * tasks | |
11 | */ | |
f8b6d1cc | 12 | SCHED_FEAT(START_DEBIT, true) |
e26af0e8 | 13 | |
e26af0e8 PZ |
14 | /* |
15 | * Prefer to schedule the task we woke last (assuming it failed | |
16 | * wakeup-preemption), since its likely going to consume data we | |
17 | * touched, increases cache locality. | |
18 | */ | |
f8b6d1cc | 19 | SCHED_FEAT(NEXT_BUDDY, false) |
e26af0e8 PZ |
20 | |
21 | /* | |
22 | * Prefer to schedule the task that ran last (when we did | |
23 | * wake-preempt) as that likely will touch the same data, increases | |
24 | * cache locality. | |
25 | */ | |
f8b6d1cc | 26 | SCHED_FEAT(LAST_BUDDY, true) |
e26af0e8 PZ |
27 | |
28 | /* | |
29 | * Consider buddies to be cache hot, decreases the likelyness of a | |
30 | * cache buddy being migrated away, increases cache locality. | |
31 | */ | |
f8b6d1cc | 32 | SCHED_FEAT(CACHE_HOT_BUDDY, true) |
e26af0e8 | 33 | |
8ed92e51 IM |
34 | /* |
35 | * Allow wakeup-time preemption of the current task: | |
36 | */ | |
37 | SCHED_FEAT(WAKEUP_PREEMPTION, true) | |
38 | ||
8e6598af | 39 | /* |
5d4dfddd | 40 | * Use arch dependent cpu capacity functions |
8e6598af | 41 | */ |
5d4dfddd | 42 | SCHED_FEAT(ARCH_CAPACITY, true) |
8e6598af | 43 | |
f8b6d1cc PZ |
44 | SCHED_FEAT(HRTICK, false) |
45 | SCHED_FEAT(DOUBLE_TICK, false) | |
46 | SCHED_FEAT(LB_BIAS, true) | |
e26af0e8 | 47 | |
aa483808 | 48 | /* |
5d4dfddd | 49 | * Decrement CPU capacity based on time not spent running tasks |
aa483808 | 50 | */ |
5d4dfddd | 51 | SCHED_FEAT(NONTASK_CAPACITY, true) |
317f3941 PZ |
52 | |
53 | /* | |
54 | * Queue remote wakeups on the target CPU and process them | |
55 | * using the scheduler IPI. Reduces rq->lock contention/bounces. | |
56 | */ | |
f8b6d1cc | 57 | SCHED_FEAT(TTWU_QUEUE, true) |
e3589f6c | 58 | |
b6366f04 SR |
59 | #ifdef HAVE_RT_PUSH_IPI |
60 | /* | |
61 | * In order to avoid a thundering herd attack of CPUs that are | |
62 | * lowering their priorities at the same time, and there being | |
63 | * a single CPU that has an RT task that can migrate and is waiting | |
64 | * to run, where the other CPUs will try to take that CPUs | |
65 | * rq lock and possibly create a large contention, sending an | |
66 | * IPI to that CPU and let that CPU push the RT task to where | |
67 | * it should go may be a better scenario. | |
68 | */ | |
69 | SCHED_FEAT(RT_PUSH_IPI, true) | |
70 | #endif | |
71 | ||
f8b6d1cc PZ |
72 | SCHED_FEAT(FORCE_SD_OVERLAP, false) |
73 | SCHED_FEAT(RT_RUNTIME_SHARE, true) | |
eb95308e | 74 | SCHED_FEAT(LB_MIN, false) |
cbee9f88 PZ |
75 | |
76 | /* | |
1a687c2e MG |
77 | * Apply the automatic NUMA scheduling policy. Enabled automatically |
78 | * at runtime if running on a NUMA machine. Can be controlled via | |
b726b7df | 79 | * numa_balancing= |
cbee9f88 PZ |
80 | */ |
81 | #ifdef CONFIG_NUMA_BALANCING | |
3a7053b3 MG |
82 | |
83 | /* | |
2a1ed24c SD |
84 | * NUMA will favor moving tasks towards nodes where a higher number of |
85 | * hinting faults are recorded during active load balancing. It will | |
86 | * resist moving tasks towards nodes where a lower number of hinting | |
87 | * faults have been recorded. | |
3a7053b3 | 88 | */ |
2a1ed24c | 89 | SCHED_FEAT(NUMA, true) |
cbee9f88 | 90 | #endif |