1 ===================== 1 =====================
2 CFS Bandwidth Control 2 CFS Bandwidth Control
3 ===================== 3 =====================
4 4
5 .. note:: !! 5 [ This document only discusses CPU bandwidth control for SCHED_NORMAL.
6 This document only discusses CPU bandwidth !! 6 The SCHED_RT case is covered in Documentation/scheduler/sched-rt-group.rst ]
7 The SCHED_RT case is covered in Documentati <<
8 7
9 CFS bandwidth control is a CONFIG_FAIR_GROUP_S 8 CFS bandwidth control is a CONFIG_FAIR_GROUP_SCHED extension which allows the
10 specification of the maximum CPU bandwidth ava 9 specification of the maximum CPU bandwidth available to a group or hierarchy.
11 10
12 The bandwidth allowed for a group is specified 11 The bandwidth allowed for a group is specified using a quota and period. Within
13 each given "period" (microseconds), a task gro 12 each given "period" (microseconds), a task group is allocated up to "quota"
14 microseconds of CPU time. That quota is assign 13 microseconds of CPU time. That quota is assigned to per-cpu run queues in
15 slices as threads in the cgroup become runnabl 14 slices as threads in the cgroup become runnable. Once all quota has been
16 assigned any additional requests for quota wil 15 assigned any additional requests for quota will result in those threads being
17 throttled. Throttled threads will not be able 16 throttled. Throttled threads will not be able to run again until the next
18 period when the quota is replenished. 17 period when the quota is replenished.
19 18
20 A group's unassigned quota is globally tracked 19 A group's unassigned quota is globally tracked, being refreshed back to
21 cfs_quota units at each period boundary. As th 20 cfs_quota units at each period boundary. As threads consume this bandwidth it
22 is transferred to cpu-local "silos" on a deman 21 is transferred to cpu-local "silos" on a demand basis. The amount transferred
23 within each of these updates is tunable and de 22 within each of these updates is tunable and described as the "slice".
24 23
25 Burst feature <<
26 ------------- <<
27 This feature borrows time now against our futu <<
28 increased interference against the other syste <<
29 <<
30 Traditional (UP-EDF) bandwidth control is some <<
31 <<
32 (U = \Sum u_i) <= 1 <<
33 <<
34 This guaranteeds both that every deadline is m <<
35 stable. After all, if U were > 1, then for eve <<
36 we'd have to run more than a second of program <<
37 our deadline, but the next deadline will be fu <<
38 never time to catch up, unbounded fail. <<
39 <<
40 The burst feature observes that a workload doe <<
41 quota; this enables one to describe u_i as a s <<
42 <<
43 For example, have u_i = {x,e}_i, where x is th <<
44 (the traditional WCET). This effectively allow <<
45 increasing the efficiency (we can pack more ta <<
46 the cost of missing deadlines when all the odd <<
47 does maintain stability, since every overrun m <<
48 underrun as long as our x is above the average <<
49 <<
50 That is, suppose we have 2 tasks, both specify <<
51 have a p(95)*p(95) = 90.25% chance both tasks <<
52 everything is good. At the same time we have a <<
53 both tasks will exceed their quota at the same <<
54 fail). Somewhere in between there's a threshol <<
55 the other doesn't underrun enough to compensat <<
56 specific CDFs. <<
57 <<
58 At the same time, we can say that the worst ca <<
59 \Sum e_i; that is, there is a bounded tardines <<
60 that x+e is indeed WCET). <<
61 <<
62 The interferenece when using burst is valued b <<
63 missing the deadline and the average WCET. Tes <<
64 there many cgroups or CPU is under utilized, t <<
65 limited. More details are shown in: <<
66 https://lore.kernel.org/lkml/5371BD36-55AE-4F7 <<
67 <<
68 Management 24 Management
69 ---------- 25 ----------
70 Quota, period and burst are managed within the !! 26 Quota and period are managed within the cpu subsystem via cgroupfs.
71 27
72 .. note:: !! 28 cpu.cfs_quota_us: the total available run-time within a period (in microseconds)
73 The cgroupfs files described in this sectio !! 29 cpu.cfs_period_us: the length of a period (in microseconds)
74 to cgroup v1. For cgroup v2, see !! 30 cpu.stat: exports throttling statistics [explained further below]
75 :ref:`Documentation/admin-guide/cgroup-v2.r <<
76 <<
77 - cpu.cfs_quota_us: run-time replenished withi <<
78 - cpu.cfs_period_us: the length of a period (i <<
79 - cpu.stat: exports throttling statistics [exp <<
80 - cpu.cfs_burst_us: the maximum accumulated ru <<
81 31
82 The default values are:: 32 The default values are::
83 33
84 cpu.cfs_period_us=100ms 34 cpu.cfs_period_us=100ms
85 cpu.cfs_quota_us=-1 !! 35 cpu.cfs_quota=-1
86 cpu.cfs_burst_us=0 <<
87 36
88 A value of -1 for cpu.cfs_quota_us indicates t 37 A value of -1 for cpu.cfs_quota_us indicates that the group does not have any
89 bandwidth restriction in place, such a group i 38 bandwidth restriction in place, such a group is described as an unconstrained
90 bandwidth group. This represents the tradition 39 bandwidth group. This represents the traditional work-conserving behavior for
91 CFS. 40 CFS.
92 41
93 Writing any (valid) positive value(s) no small !! 42 Writing any (valid) positive value(s) will enact the specified bandwidth limit.
94 enact the specified bandwidth limit. The minim !! 43 The minimum quota allowed for the quota or period is 1ms. There is also an
95 period is 1ms. There is also an upper bound on !! 44 upper bound on the period length of 1s. Additional restrictions exist when
96 Additional restrictions exist when bandwidth l !! 45 bandwidth limits are used in a hierarchical fashion, these are explained in
97 fashion, these are explained in more detail be !! 46 more detail below.
98 47
99 Writing any negative value to cpu.cfs_quota_us 48 Writing any negative value to cpu.cfs_quota_us will remove the bandwidth limit
100 and return the group to an unconstrained state 49 and return the group to an unconstrained state once more.
101 50
102 A value of 0 for cpu.cfs_burst_us indicates th <<
103 any unused bandwidth. It makes the traditional <<
104 CFS unchanged. Writing any (valid) positive va <<
105 cpu.cfs_quota_us into cpu.cfs_burst_us will en <<
106 accumulation. <<
107 <<
108 Any updates to a group's bandwidth specificati 51 Any updates to a group's bandwidth specification will result in it becoming
109 unthrottled if it is in a constrained state. 52 unthrottled if it is in a constrained state.
110 53
111 System wide settings 54 System wide settings
112 -------------------- 55 --------------------
113 For efficiency run-time is transferred between 56 For efficiency run-time is transferred between the global pool and CPU local
114 "silos" in a batch fashion. This greatly reduc 57 "silos" in a batch fashion. This greatly reduces global accounting pressure
115 on large systems. The amount transferred each 58 on large systems. The amount transferred each time such an update is required
116 is described as the "slice". 59 is described as the "slice".
117 60
118 This is tunable via procfs:: 61 This is tunable via procfs::
119 62
120 /proc/sys/kernel/sched_cfs_bandwidth_s 63 /proc/sys/kernel/sched_cfs_bandwidth_slice_us (default=5ms)
121 64
122 Larger slice values will reduce transfer overh 65 Larger slice values will reduce transfer overheads, while smaller values allow
123 for more fine-grained consumption. 66 for more fine-grained consumption.
124 67
125 Statistics 68 Statistics
126 ---------- 69 ----------
127 A group's bandwidth statistics are exported vi !! 70 A group's bandwidth statistics are exported via 3 fields in cpu.stat.
128 71
129 cpu.stat: 72 cpu.stat:
130 73
131 - nr_periods: Number of enforcement intervals 74 - nr_periods: Number of enforcement intervals that have elapsed.
132 - nr_throttled: Number of times the group has 75 - nr_throttled: Number of times the group has been throttled/limited.
133 - throttled_time: The total time duration (in 76 - throttled_time: The total time duration (in nanoseconds) for which entities
134 of the group have been throttled. 77 of the group have been throttled.
135 - nr_bursts: Number of periods burst occurs. <<
136 - burst_time: Cumulative wall-time (in nanosec <<
137 above quota in respective periods. <<
138 78
139 This interface is read-only. 79 This interface is read-only.
140 80
141 Hierarchical considerations 81 Hierarchical considerations
142 --------------------------- 82 ---------------------------
143 The interface enforces that an individual enti 83 The interface enforces that an individual entity's bandwidth is always
144 attainable, that is: max(c_i) <= C. However, o 84 attainable, that is: max(c_i) <= C. However, over-subscription in the
145 aggregate case is explicitly allowed to enable 85 aggregate case is explicitly allowed to enable work-conserving semantics
146 within a hierarchy: 86 within a hierarchy:
147 87
148 e.g. \Sum (c_i) may exceed C 88 e.g. \Sum (c_i) may exceed C
149 89
150 [ Where C is the parent's bandwidth, and c_i i 90 [ Where C is the parent's bandwidth, and c_i its children ]
151 91
152 92
153 There are two ways in which a group may become 93 There are two ways in which a group may become throttled:
154 94
155 a. it fully consumes its own quota wit 95 a. it fully consumes its own quota within a period
156 b. a parent's quota is fully consumed 96 b. a parent's quota is fully consumed within its period
157 97
158 In case b) above, even though the child may ha 98 In case b) above, even though the child may have runtime remaining it will not
159 be allowed to until the parent's runtime is re 99 be allowed to until the parent's runtime is refreshed.
160 100
161 CFS Bandwidth Quota Caveats 101 CFS Bandwidth Quota Caveats
162 --------------------------- 102 ---------------------------
163 Once a slice is assigned to a cpu it does not 103 Once a slice is assigned to a cpu it does not expire. However all but 1ms of
164 the slice may be returned to the global pool i 104 the slice may be returned to the global pool if all threads on that cpu become
165 unrunnable. This is configured at compile time 105 unrunnable. This is configured at compile time by the min_cfs_rq_runtime
166 variable. This is a performance tweak that hel 106 variable. This is a performance tweak that helps prevent added contention on
167 the global lock. 107 the global lock.
168 108
169 The fact that cpu-local slices do not expire r 109 The fact that cpu-local slices do not expire results in some interesting corner
170 cases that should be understood. 110 cases that should be understood.
171 111
172 For cgroup cpu constrained applications that a 112 For cgroup cpu constrained applications that are cpu limited this is a
173 relatively moot point because they will natura 113 relatively moot point because they will naturally consume the entirety of their
174 quota as well as the entirety of each cpu-loca 114 quota as well as the entirety of each cpu-local slice in each period. As a
175 result it is expected that nr_periods roughly 115 result it is expected that nr_periods roughly equal nr_throttled, and that
176 cpuacct.usage will increase roughly equal to c 116 cpuacct.usage will increase roughly equal to cfs_quota_us in each period.
177 117
178 For highly-threaded, non-cpu bound application 118 For highly-threaded, non-cpu bound applications this non-expiration nuance
179 allows applications to briefly burst past thei 119 allows applications to briefly burst past their quota limits by the amount of
180 unused slice on each cpu that the task group i 120 unused slice on each cpu that the task group is running on (typically at most
181 1ms per cpu or as defined by min_cfs_rq_runtim 121 1ms per cpu or as defined by min_cfs_rq_runtime). This slight burst only
182 applies if quota had been assigned to a cpu an 122 applies if quota had been assigned to a cpu and then not fully used or returned
183 in previous periods. This burst amount will no 123 in previous periods. This burst amount will not be transferred between cores.
184 As a result, this mechanism still strictly lim 124 As a result, this mechanism still strictly limits the task group to quota
185 average usage, albeit over a longer time windo 125 average usage, albeit over a longer time window than a single period. This
186 also limits the burst ability to no more than 126 also limits the burst ability to no more than 1ms per cpu. This provides
187 better more predictable user experience for hi 127 better more predictable user experience for highly threaded applications with
188 small quota limits on high core count machines 128 small quota limits on high core count machines. It also eliminates the
189 propensity to throttle these applications whil !! 129 propensity to throttle these applications while simultanously using less than
190 quota amounts of cpu. Another way to say this, 130 quota amounts of cpu. Another way to say this, is that by allowing the unused
191 portion of a slice to remain valid across peri 131 portion of a slice to remain valid across periods we have decreased the
192 possibility of wastefully expiring quota on cp 132 possibility of wastefully expiring quota on cpu-local silos that don't need a
193 full slice's amount of cpu time. 133 full slice's amount of cpu time.
194 134
195 The interaction between cpu-bound and non-cpu- 135 The interaction between cpu-bound and non-cpu-bound-interactive applications
196 should also be considered, especially when sin 136 should also be considered, especially when single core usage hits 100%. If you
197 gave each of these applications half of a cpu- 137 gave each of these applications half of a cpu-core and they both got scheduled
198 on the same CPU it is theoretically possible t 138 on the same CPU it is theoretically possible that the non-cpu bound application
199 will use up to 1ms additional quota in some pe 139 will use up to 1ms additional quota in some periods, thereby preventing the
200 cpu-bound application from fully using its quo 140 cpu-bound application from fully using its quota by that same amount. In these
201 instances it will be up to the CFS algorithm ( 141 instances it will be up to the CFS algorithm (see sched-design-CFS.rst) to
202 decide which application is chosen to run, as 142 decide which application is chosen to run, as they will both be runnable and
203 have remaining quota. This runtime discrepancy 143 have remaining quota. This runtime discrepancy will be made up in the following
204 periods when the interactive application idles 144 periods when the interactive application idles.
205 145
206 Examples 146 Examples
207 -------- 147 --------
208 1. Limit a group to 1 CPU worth of runtime:: 148 1. Limit a group to 1 CPU worth of runtime::
209 149
210 If period is 250ms and quota is also 2 150 If period is 250ms and quota is also 250ms, the group will get
211 1 CPU worth of runtime every 250ms. 151 1 CPU worth of runtime every 250ms.
212 152
213 # echo 250000 > cpu.cfs_quota_us /* qu 153 # echo 250000 > cpu.cfs_quota_us /* quota = 250ms */
214 # echo 250000 > cpu.cfs_period_us /* p 154 # echo 250000 > cpu.cfs_period_us /* period = 250ms */
215 155
216 2. Limit a group to 2 CPUs worth of runtime on 156 2. Limit a group to 2 CPUs worth of runtime on a multi-CPU machine
217 157
218 With 500ms period and 1000ms quota, the gro 158 With 500ms period and 1000ms quota, the group can get 2 CPUs worth of
219 runtime every 500ms:: 159 runtime every 500ms::
220 160
221 # echo 1000000 > cpu.cfs_quota_us /* q 161 # echo 1000000 > cpu.cfs_quota_us /* quota = 1000ms */
222 # echo 500000 > cpu.cfs_period_us /* p 162 # echo 500000 > cpu.cfs_period_us /* period = 500ms */
223 163
224 The larger period here allows for incr 164 The larger period here allows for increased burst capacity.
225 165
226 3. Limit a group to 20% of 1 CPU. 166 3. Limit a group to 20% of 1 CPU.
227 167
228 With 50ms period, 10ms quota will be equiva 168 With 50ms period, 10ms quota will be equivalent to 20% of 1 CPU::
229 169
230 # echo 10000 > cpu.cfs_quota_us /* quo 170 # echo 10000 > cpu.cfs_quota_us /* quota = 10ms */
231 # echo 50000 > cpu.cfs_period_us /* pe 171 # echo 50000 > cpu.cfs_period_us /* period = 50ms */
232 172
233 By using a small period here we are ensurin 173 By using a small period here we are ensuring a consistent latency
234 response at the expense of burst capacity. 174 response at the expense of burst capacity.
235 <<
236 4. Limit a group to 40% of 1 CPU, and allow ac <<
237 additionally, in case accumulation has been <<
238 <<
239 With 50ms period, 20ms quota will be equiva <<
240 And 10ms burst will be equivalent to 20% of <<
241 <<
242 # echo 20000 > cpu.cfs_quota_us /* quo <<
243 # echo 50000 > cpu.cfs_period_us /* pe <<
244 # echo 10000 > cpu.cfs_burst_us /* bur <<
245 <<
246 Larger buffer setting (no larger than quota <<
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.