sched_features.h 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123
  1. /*
  2. * Disregards a certain amount of sleep time (sched_latency_ns) and
  3. * considers the task to be running during that period. This gives it
  4. * a service deficit on wakeup, allowing it to run sooner.
  5. */
  6. SCHED_FEAT(FAIR_SLEEPERS, 1)
  7. /*
  8. * Only give sleepers 50% of their service deficit. This allows
  9. * them to run sooner, but does not allow tons of sleepers to
  10. * rip the spread apart.
  11. */
  12. SCHED_FEAT(GENTLE_FAIR_SLEEPERS, 1)
  13. /*
  14. * By not normalizing the sleep time, heavy tasks get an effective
  15. * longer period, and lighter task an effective shorter period they
  16. * are considered running.
  17. */
  18. SCHED_FEAT(NORMALIZED_SLEEPER, 0)
  19. /*
  20. * Place new tasks ahead so that they do not starve already running
  21. * tasks
  22. */
  23. SCHED_FEAT(START_DEBIT, 1)
  24. /*
  25. * Should wakeups try to preempt running tasks.
  26. */
  27. SCHED_FEAT(WAKEUP_PREEMPT, 1)
  28. /*
  29. * Compute wakeup_gran based on task behaviour, clipped to
  30. * [0, sched_wakeup_gran_ns]
  31. */
  32. SCHED_FEAT(ADAPTIVE_GRAN, 1)
  33. /*
  34. * When converting the wakeup granularity to virtual time, do it such
  35. * that heavier tasks preempting a lighter task have an edge.
  36. */
  37. SCHED_FEAT(ASYM_GRAN, 1)
  38. /*
  39. * Always wakeup-preempt SYNC wakeups, see SYNC_WAKEUPS.
  40. */
  41. SCHED_FEAT(WAKEUP_SYNC, 0)
  42. /*
  43. * Wakeup preempt based on task behaviour. Tasks that do not overlap
  44. * don't get preempted.
  45. */
  46. SCHED_FEAT(WAKEUP_OVERLAP, 0)
  47. /*
  48. * Wakeup preemption towards tasks that run short
  49. */
  50. SCHED_FEAT(WAKEUP_RUNNING, 0)
  51. /*
  52. * Use the SYNC wakeup hint, pipes and the likes use this to indicate
  53. * the remote end is likely to consume the data we just wrote, and
  54. * therefore has cache benefit from being placed on the same cpu, see
  55. * also AFFINE_WAKEUPS.
  56. */
  57. SCHED_FEAT(SYNC_WAKEUPS, 1)
  58. /*
  59. * Based on load and program behaviour, see if it makes sense to place
  60. * a newly woken task on the same cpu as the task that woke it --
  61. * improve cache locality. Typically used with SYNC wakeups as
  62. * generated by pipes and the like, see also SYNC_WAKEUPS.
  63. */
  64. SCHED_FEAT(AFFINE_WAKEUPS, 1)
  65. /*
  66. * Weaken SYNC hint based on overlap
  67. */
  68. SCHED_FEAT(SYNC_LESS, 1)
  69. /*
  70. * Add SYNC hint based on overlap
  71. */
  72. SCHED_FEAT(SYNC_MORE, 0)
  73. /*
  74. * Prefer to schedule the task we woke last (assuming it failed
  75. * wakeup-preemption), since its likely going to consume data we
  76. * touched, increases cache locality.
  77. */
  78. SCHED_FEAT(NEXT_BUDDY, 0)
  79. /*
  80. * Prefer to schedule the task that ran last (when we did
  81. * wake-preempt) as that likely will touch the same data, increases
  82. * cache locality.
  83. */
  84. SCHED_FEAT(LAST_BUDDY, 1)
  85. /*
  86. * Consider buddies to be cache hot, decreases the likelyness of a
  87. * cache buddy being migrated away, increases cache locality.
  88. */
  89. SCHED_FEAT(CACHE_HOT_BUDDY, 1)
  90. /*
  91. * Use arch dependent cpu power functions
  92. */
  93. SCHED_FEAT(ARCH_POWER, 0)
  94. SCHED_FEAT(HRTICK, 0)
  95. SCHED_FEAT(DOUBLE_TICK, 0)
  96. SCHED_FEAT(LB_BIAS, 1)
  97. SCHED_FEAT(LB_SHARES_UPDATE, 1)
  98. SCHED_FEAT(ASYM_EFF_LOAD, 1)
  99. /*
  100. * Spin-wait on mutex acquisition when the mutex owner is running on
  101. * another cpu -- assumes that when the owner is running, it will soon
  102. * release the lock. Decreases scheduling overhead.
  103. */
  104. SCHED_FEAT(OWNER_SPIN, 1)