features.h 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
  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. */
  6. SCHED_FEAT(GENTLE_FAIR_SLEEPERS, true)
  7. /*
  8. * Place new tasks ahead so that they do not starve already running
  9. * tasks
  10. */
  11. SCHED_FEAT(START_DEBIT, true)
  12. /*
  13. * Prefer to schedule the task we woke last (assuming it failed
  14. * wakeup-preemption), since its likely going to consume data we
  15. * touched, increases cache locality.
  16. */
  17. SCHED_FEAT(NEXT_BUDDY, false)
  18. /*
  19. * Prefer to schedule the task that ran last (when we did
  20. * wake-preempt) as that likely will touch the same data, increases
  21. * cache locality.
  22. */
  23. SCHED_FEAT(LAST_BUDDY, true)
  24. /*
  25. * Consider buddies to be cache hot, decreases the likelyness of a
  26. * cache buddy being migrated away, increases cache locality.
  27. */
  28. SCHED_FEAT(CACHE_HOT_BUDDY, true)
  29. /*
  30. * Allow wakeup-time preemption of the current task:
  31. */
  32. SCHED_FEAT(WAKEUP_PREEMPTION, true)
  33. /*
  34. * Use arch dependent cpu capacity functions
  35. */
  36. SCHED_FEAT(ARCH_CAPACITY, true)
  37. SCHED_FEAT(HRTICK, false)
  38. SCHED_FEAT(DOUBLE_TICK, false)
  39. SCHED_FEAT(LB_BIAS, true)
  40. /*
  41. * Decrement CPU capacity based on time not spent running tasks
  42. */
  43. SCHED_FEAT(NONTASK_CAPACITY, true)
  44. /*
  45. * Queue remote wakeups on the target CPU and process them
  46. * using the scheduler IPI. Reduces rq->lock contention/bounces.
  47. */
  48. SCHED_FEAT(TTWU_QUEUE, true)
  49. #ifdef HAVE_RT_PUSH_IPI
  50. /*
  51. * In order to avoid a thundering herd attack of CPUs that are
  52. * lowering their priorities at the same time, and there being
  53. * a single CPU that has an RT task that can migrate and is waiting
  54. * to run, where the other CPUs will try to take that CPUs
  55. * rq lock and possibly create a large contention, sending an
  56. * IPI to that CPU and let that CPU push the RT task to where
  57. * it should go may be a better scenario.
  58. */
  59. SCHED_FEAT(RT_PUSH_IPI, true)
  60. #endif
  61. SCHED_FEAT(FORCE_SD_OVERLAP, false)
  62. SCHED_FEAT(RT_RUNTIME_SHARE, true)
  63. SCHED_FEAT(LB_MIN, false)
  64. /*
  65. * Apply the automatic NUMA scheduling policy. Enabled automatically
  66. * at runtime if running on a NUMA machine. Can be controlled via
  67. * numa_balancing=
  68. */
  69. #ifdef CONFIG_NUMA_BALANCING
  70. SCHED_FEAT(NUMA, false)
  71. /*
  72. * NUMA_FAVOUR_HIGHER will favor moving tasks towards nodes where a
  73. * higher number of hinting faults are recorded during active load
  74. * balancing.
  75. */
  76. SCHED_FEAT(NUMA_FAVOUR_HIGHER, true)
  77. /*
  78. * NUMA_RESIST_LOWER will resist moving tasks towards nodes where a
  79. * lower number of hinting faults have been recorded. As this has
  80. * the potential to prevent a task ever migrating to a new node
  81. * due to CPU overload it is disabled by default.
  82. */
  83. SCHED_FEAT(NUMA_RESIST_LOWER, false)
  84. #endif