]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | CPUSETS |
2 | ------- | |
3 | ||
4 | Copyright (C) 2004 BULL SA. | |
5 | Written by Simon.Derr@bull.net | |
6 | ||
b4fb3766 | 7 | Portions Copyright (c) 2004-2006 Silicon Graphics, Inc. |
1da177e4 | 8 | Modified by Paul Jackson <pj@sgi.com> |
b4fb3766 | 9 | Modified by Christoph Lameter <clameter@sgi.com> |
8793d854 | 10 | Modified by Paul Menage <menage@google.com> |
4d5f3553 | 11 | Modified by Hidetoshi Seto <seto.hidetoshi@jp.fujitsu.com> |
1da177e4 LT |
12 | |
13 | CONTENTS: | |
14 | ========= | |
15 | ||
16 | 1. Cpusets | |
17 | 1.1 What are cpusets ? | |
18 | 1.2 Why are cpusets needed ? | |
19 | 1.3 How are cpusets implemented ? | |
bd5e09cf | 20 | 1.4 What are exclusive cpusets ? |
8793d854 PM |
21 | 1.5 What is memory_pressure ? |
22 | 1.6 What is memory spread ? | |
029190c5 | 23 | 1.7 What is sched_load_balance ? |
4d5f3553 HS |
24 | 1.8 What is sched_relax_domain_level ? |
25 | 1.9 How do I use cpusets ? | |
1da177e4 LT |
26 | 2. Usage Examples and Syntax |
27 | 2.1 Basic Usage | |
28 | 2.2 Adding/removing cpus | |
29 | 2.3 Setting flags | |
30 | 2.4 Attaching processes | |
31 | 3. Questions | |
32 | 4. Contact | |
33 | ||
34 | 1. Cpusets | |
35 | ========== | |
36 | ||
37 | 1.1 What are cpusets ? | |
38 | ---------------------- | |
39 | ||
40 | Cpusets provide a mechanism for assigning a set of CPUs and Memory | |
0e1e7c7a CL |
41 | Nodes to a set of tasks. In this document "Memory Node" refers to |
42 | an on-line node that contains memory. | |
1da177e4 LT |
43 | |
44 | Cpusets constrain the CPU and Memory placement of tasks to only | |
45 | the resources within a tasks current cpuset. They form a nested | |
46 | hierarchy visible in a virtual file system. These are the essential | |
47 | hooks, beyond what is already present, required to manage dynamic | |
48 | job placement on large systems. | |
49 | ||
8793d854 PM |
50 | Cpusets use the generic cgroup subsystem described in |
51 | Documentation/cgroup.txt. | |
52 | ||
53 | Requests by a task, using the sched_setaffinity(2) system call to | |
54 | include CPUs in its CPU affinity mask, and using the mbind(2) and | |
55 | set_mempolicy(2) system calls to include Memory Nodes in its memory | |
56 | policy, are both filtered through that tasks cpuset, filtering out any | |
57 | CPUs or Memory Nodes not in that cpuset. The scheduler will not | |
58 | schedule a task on a CPU that is not allowed in its cpus_allowed | |
59 | vector, and the kernel page allocator will not allocate a page on a | |
60 | node that is not allowed in the requesting tasks mems_allowed vector. | |
61 | ||
62 | User level code may create and destroy cpusets by name in the cgroup | |
1da177e4 LT |
63 | virtual file system, manage the attributes and permissions of these |
64 | cpusets and which CPUs and Memory Nodes are assigned to each cpuset, | |
65 | specify and query to which cpuset a task is assigned, and list the | |
66 | task pids assigned to a cpuset. | |
67 | ||
68 | ||
69 | 1.2 Why are cpusets needed ? | |
70 | ---------------------------- | |
71 | ||
72 | The management of large computer systems, with many processors (CPUs), | |
73 | complex memory cache hierarchies and multiple Memory Nodes having | |
74 | non-uniform access times (NUMA) presents additional challenges for | |
75 | the efficient scheduling and memory placement of processes. | |
76 | ||
77 | Frequently more modest sized systems can be operated with adequate | |
78 | efficiency just by letting the operating system automatically share | |
79 | the available CPU and Memory resources amongst the requesting tasks. | |
80 | ||
81 | But larger systems, which benefit more from careful processor and | |
82 | memory placement to reduce memory access times and contention, | |
83 | and which typically represent a larger investment for the customer, | |
33430dc5 | 84 | can benefit from explicitly placing jobs on properly sized subsets of |
1da177e4 LT |
85 | the system. |
86 | ||
87 | This can be especially valuable on: | |
88 | ||
89 | * Web Servers running multiple instances of the same web application, | |
90 | * Servers running different applications (for instance, a web server | |
91 | and a database), or | |
92 | * NUMA systems running large HPC applications with demanding | |
93 | performance characteristics. | |
94 | ||
95 | These subsets, or "soft partitions" must be able to be dynamically | |
96 | adjusted, as the job mix changes, without impacting other concurrently | |
b4fb3766 CL |
97 | executing jobs. The location of the running jobs pages may also be moved |
98 | when the memory locations are changed. | |
1da177e4 LT |
99 | |
100 | The kernel cpuset patch provides the minimum essential kernel | |
101 | mechanisms required to efficiently implement such subsets. It | |
102 | leverages existing CPU and Memory Placement facilities in the Linux | |
103 | kernel to avoid any additional impact on the critical scheduler or | |
104 | memory allocator code. | |
105 | ||
106 | ||
107 | 1.3 How are cpusets implemented ? | |
108 | --------------------------------- | |
109 | ||
b4fb3766 CL |
110 | Cpusets provide a Linux kernel mechanism to constrain which CPUs and |
111 | Memory Nodes are used by a process or set of processes. | |
1da177e4 LT |
112 | |
113 | The Linux kernel already has a pair of mechanisms to specify on which | |
114 | CPUs a task may be scheduled (sched_setaffinity) and on which Memory | |
115 | Nodes it may obtain memory (mbind, set_mempolicy). | |
116 | ||
117 | Cpusets extends these two mechanisms as follows: | |
118 | ||
119 | - Cpusets are sets of allowed CPUs and Memory Nodes, known to the | |
120 | kernel. | |
121 | - Each task in the system is attached to a cpuset, via a pointer | |
8793d854 | 122 | in the task structure to a reference counted cgroup structure. |
1da177e4 LT |
123 | - Calls to sched_setaffinity are filtered to just those CPUs |
124 | allowed in that tasks cpuset. | |
125 | - Calls to mbind and set_mempolicy are filtered to just | |
126 | those Memory Nodes allowed in that tasks cpuset. | |
127 | - The root cpuset contains all the systems CPUs and Memory | |
128 | Nodes. | |
129 | - For any cpuset, one can define child cpusets containing a subset | |
130 | of the parents CPU and Memory Node resources. | |
131 | - The hierarchy of cpusets can be mounted at /dev/cpuset, for | |
132 | browsing and manipulation from user space. | |
133 | - A cpuset may be marked exclusive, which ensures that no other | |
134 | cpuset (except direct ancestors and descendents) may contain | |
135 | any overlapping CPUs or Memory Nodes. | |
136 | - You can list all the tasks (by pid) attached to any cpuset. | |
137 | ||
138 | The implementation of cpusets requires a few, simple hooks | |
139 | into the rest of the kernel, none in performance critical paths: | |
140 | ||
864913f3 | 141 | - in init/main.c, to initialize the root cpuset at system boot. |
1da177e4 LT |
142 | - in fork and exit, to attach and detach a task from its cpuset. |
143 | - in sched_setaffinity, to mask the requested CPUs by what's | |
144 | allowed in that tasks cpuset. | |
145 | - in sched.c migrate_all_tasks(), to keep migrating tasks within | |
146 | the CPUs allowed by their cpuset, if possible. | |
147 | - in the mbind and set_mempolicy system calls, to mask the requested | |
148 | Memory Nodes by what's allowed in that tasks cpuset. | |
864913f3 | 149 | - in page_alloc.c, to restrict memory to allowed nodes. |
1da177e4 LT |
150 | - in vmscan.c, to restrict page recovery to the current cpuset. |
151 | ||
8793d854 PM |
152 | You should mount the "cgroup" filesystem type in order to enable |
153 | browsing and modifying the cpusets presently known to the kernel. No | |
154 | new system calls are added for cpusets - all support for querying and | |
155 | modifying cpusets is via this cpuset file system. | |
1da177e4 LT |
156 | |
157 | The /proc/<pid>/status file for each task has two added lines, | |
158 | displaying the tasks cpus_allowed (on which CPUs it may be scheduled) | |
159 | and mems_allowed (on which Memory Nodes it may obtain memory), | |
160 | in the format seen in the following example: | |
161 | ||
162 | Cpus_allowed: ffffffff,ffffffff,ffffffff,ffffffff | |
163 | Mems_allowed: ffffffff,ffffffff | |
164 | ||
8793d854 PM |
165 | Each cpuset is represented by a directory in the cgroup file system |
166 | containing (on top of the standard cgroup files) the following | |
167 | files describing that cpuset: | |
1da177e4 LT |
168 | |
169 | - cpus: list of CPUs in that cpuset | |
170 | - mems: list of Memory Nodes in that cpuset | |
45b07ef3 | 171 | - memory_migrate flag: if set, move pages to cpusets nodes |
1da177e4 LT |
172 | - cpu_exclusive flag: is cpu placement exclusive? |
173 | - mem_exclusive flag: is memory placement exclusive? | |
bd5e09cf PJ |
174 | - memory_pressure: measure of how much paging pressure in cpuset |
175 | ||
176 | In addition, the root cpuset only has the following file: | |
177 | - memory_pressure_enabled flag: compute memory_pressure? | |
1da177e4 LT |
178 | |
179 | New cpusets are created using the mkdir system call or shell | |
180 | command. The properties of a cpuset, such as its flags, allowed | |
181 | CPUs and Memory Nodes, and attached tasks, are modified by writing | |
182 | to the appropriate file in that cpusets directory, as listed above. | |
183 | ||
184 | The named hierarchical structure of nested cpusets allows partitioning | |
185 | a large system into nested, dynamically changeable, "soft-partitions". | |
186 | ||
187 | The attachment of each task, automatically inherited at fork by any | |
188 | children of that task, to a cpuset allows organizing the work load | |
189 | on a system into related sets of tasks such that each set is constrained | |
190 | to using the CPUs and Memory Nodes of a particular cpuset. A task | |
191 | may be re-attached to any other cpuset, if allowed by the permissions | |
192 | on the necessary cpuset file system directories. | |
193 | ||
194 | Such management of a system "in the large" integrates smoothly with | |
195 | the detailed placement done on individual tasks and memory regions | |
196 | using the sched_setaffinity, mbind and set_mempolicy system calls. | |
197 | ||
198 | The following rules apply to each cpuset: | |
199 | ||
200 | - Its CPUs and Memory Nodes must be a subset of its parents. | |
201 | - It can only be marked exclusive if its parent is. | |
202 | - If its cpu or memory is exclusive, they may not overlap any sibling. | |
203 | ||
204 | These rules, and the natural hierarchy of cpusets, enable efficient | |
205 | enforcement of the exclusive guarantee, without having to scan all | |
206 | cpusets every time any of them change to ensure nothing overlaps a | |
207 | exclusive cpuset. Also, the use of a Linux virtual file system (vfs) | |
208 | to represent the cpuset hierarchy provides for a familiar permission | |
209 | and name space for cpusets, with a minimum of additional kernel code. | |
210 | ||
38837fc7 PJ |
211 | The cpus and mems files in the root (top_cpuset) cpuset are |
212 | read-only. The cpus file automatically tracks the value of | |
213 | cpu_online_map using a CPU hotplug notifier, and the mems file | |
0b720378 | 214 | automatically tracks the value of node_states[N_HIGH_MEMORY]--i.e., |
0e1e7c7a | 215 | nodes with memory--using the cpuset_track_online_nodes() hook. |
4c4d50f7 | 216 | |
bd5e09cf PJ |
217 | |
218 | 1.4 What are exclusive cpusets ? | |
219 | -------------------------------- | |
220 | ||
221 | If a cpuset is cpu or mem exclusive, no other cpuset, other than | |
222 | a direct ancestor or descendent, may share any of the same CPUs or | |
223 | Memory Nodes. | |
224 | ||
bd5e09cf PJ |
225 | A cpuset that is mem_exclusive restricts kernel allocations for |
226 | page, buffer and other data commonly shared by the kernel across | |
227 | multiple users. All cpusets, whether mem_exclusive or not, restrict | |
228 | allocations of memory for user space. This enables configuring a | |
229 | system so that several independent jobs can share common kernel data, | |
230 | such as file system pages, while isolating each jobs user allocation in | |
231 | its own cpuset. To do this, construct a large mem_exclusive cpuset to | |
232 | hold all the jobs, and construct child, non-mem_exclusive cpusets for | |
233 | each individual job. Only a small amount of typical kernel memory, | |
234 | such as requests from interrupt handlers, is allowed to be taken | |
235 | outside even a mem_exclusive cpuset. | |
236 | ||
237 | ||
8793d854 | 238 | 1.5 What is memory_pressure ? |
bd5e09cf PJ |
239 | ----------------------------- |
240 | The memory_pressure of a cpuset provides a simple per-cpuset metric | |
241 | of the rate that the tasks in a cpuset are attempting to free up in | |
242 | use memory on the nodes of the cpuset to satisfy additional memory | |
243 | requests. | |
244 | ||
245 | This enables batch managers monitoring jobs running in dedicated | |
246 | cpusets to efficiently detect what level of memory pressure that job | |
247 | is causing. | |
248 | ||
249 | This is useful both on tightly managed systems running a wide mix of | |
250 | submitted jobs, which may choose to terminate or re-prioritize jobs that | |
251 | are trying to use more memory than allowed on the nodes assigned them, | |
252 | and with tightly coupled, long running, massively parallel scientific | |
253 | computing jobs that will dramatically fail to meet required performance | |
254 | goals if they start to use more memory than allowed to them. | |
255 | ||
256 | This mechanism provides a very economical way for the batch manager | |
257 | to monitor a cpuset for signs of memory pressure. It's up to the | |
258 | batch manager or other user code to decide what to do about it and | |
259 | take action. | |
260 | ||
261 | ==> Unless this feature is enabled by writing "1" to the special file | |
262 | /dev/cpuset/memory_pressure_enabled, the hook in the rebalance | |
263 | code of __alloc_pages() for this metric reduces to simply noticing | |
264 | that the cpuset_memory_pressure_enabled flag is zero. So only | |
265 | systems that enable this feature will compute the metric. | |
266 | ||
267 | Why a per-cpuset, running average: | |
268 | ||
269 | Because this meter is per-cpuset, rather than per-task or mm, | |
270 | the system load imposed by a batch scheduler monitoring this | |
271 | metric is sharply reduced on large systems, because a scan of | |
272 | the tasklist can be avoided on each set of queries. | |
273 | ||
274 | Because this meter is a running average, instead of an accumulating | |
275 | counter, a batch scheduler can detect memory pressure with a | |
276 | single read, instead of having to read and accumulate results | |
277 | for a period of time. | |
278 | ||
279 | Because this meter is per-cpuset rather than per-task or mm, | |
280 | the batch scheduler can obtain the key information, memory | |
281 | pressure in a cpuset, with a single read, rather than having to | |
282 | query and accumulate results over all the (dynamically changing) | |
283 | set of tasks in the cpuset. | |
284 | ||
285 | A per-cpuset simple digital filter (requires a spinlock and 3 words | |
286 | of data per-cpuset) is kept, and updated by any task attached to that | |
287 | cpuset, if it enters the synchronous (direct) page reclaim code. | |
288 | ||
289 | A per-cpuset file provides an integer number representing the recent | |
290 | (half-life of 10 seconds) rate of direct page reclaims caused by | |
291 | the tasks in the cpuset, in units of reclaims attempted per second, | |
292 | times 1000. | |
293 | ||
294 | ||
8793d854 | 295 | 1.6 What is memory spread ? |
825a46af PJ |
296 | --------------------------- |
297 | There are two boolean flag files per cpuset that control where the | |
298 | kernel allocates pages for the file system buffers and related in | |
299 | kernel data structures. They are called 'memory_spread_page' and | |
300 | 'memory_spread_slab'. | |
301 | ||
302 | If the per-cpuset boolean flag file 'memory_spread_page' is set, then | |
303 | the kernel will spread the file system buffers (page cache) evenly | |
304 | over all the nodes that the faulting task is allowed to use, instead | |
305 | of preferring to put those pages on the node where the task is running. | |
306 | ||
307 | If the per-cpuset boolean flag file 'memory_spread_slab' is set, | |
308 | then the kernel will spread some file system related slab caches, | |
309 | such as for inodes and dentries evenly over all the nodes that the | |
310 | faulting task is allowed to use, instead of preferring to put those | |
311 | pages on the node where the task is running. | |
312 | ||
313 | The setting of these flags does not affect anonymous data segment or | |
314 | stack segment pages of a task. | |
315 | ||
316 | By default, both kinds of memory spreading are off, and memory | |
317 | pages are allocated on the node local to where the task is running, | |
318 | except perhaps as modified by the tasks NUMA mempolicy or cpuset | |
319 | configuration, so long as sufficient free memory pages are available. | |
320 | ||
321 | When new cpusets are created, they inherit the memory spread settings | |
322 | of their parent. | |
323 | ||
324 | Setting memory spreading causes allocations for the affected page | |
325 | or slab caches to ignore the tasks NUMA mempolicy and be spread | |
326 | instead. Tasks using mbind() or set_mempolicy() calls to set NUMA | |
327 | mempolicies will not notice any change in these calls as a result of | |
328 | their containing tasks memory spread settings. If memory spreading | |
329 | is turned off, then the currently specified NUMA mempolicy once again | |
330 | applies to memory page allocations. | |
331 | ||
332 | Both 'memory_spread_page' and 'memory_spread_slab' are boolean flag | |
333 | files. By default they contain "0", meaning that the feature is off | |
334 | for that cpuset. If a "1" is written to that file, then that turns | |
335 | the named feature on. | |
336 | ||
337 | The implementation is simple. | |
338 | ||
339 | Setting the flag 'memory_spread_page' turns on a per-process flag | |
340 | PF_SPREAD_PAGE for each task that is in that cpuset or subsequently | |
341 | joins that cpuset. The page allocation calls for the page cache | |
342 | is modified to perform an inline check for this PF_SPREAD_PAGE task | |
343 | flag, and if set, a call to a new routine cpuset_mem_spread_node() | |
344 | returns the node to prefer for the allocation. | |
345 | ||
346 | Similarly, setting 'memory_spread_cache' turns on the flag | |
347 | PF_SPREAD_SLAB, and appropriately marked slab caches will allocate | |
348 | pages from the node returned by cpuset_mem_spread_node(). | |
349 | ||
350 | The cpuset_mem_spread_node() routine is also simple. It uses the | |
351 | value of a per-task rotor cpuset_mem_spread_rotor to select the next | |
352 | node in the current tasks mems_allowed to prefer for the allocation. | |
353 | ||
354 | This memory placement policy is also known (in other contexts) as | |
355 | round-robin or interleave. | |
356 | ||
357 | This policy can provide substantial improvements for jobs that need | |
358 | to place thread local data on the corresponding node, but that need | |
359 | to access large file system data sets that need to be spread across | |
360 | the several nodes in the jobs cpuset in order to fit. Without this | |
361 | policy, especially for jobs that might have one thread reading in the | |
362 | data set, the memory allocation across the nodes in the jobs cpuset | |
363 | can become very uneven. | |
364 | ||
029190c5 PJ |
365 | 1.7 What is sched_load_balance ? |
366 | -------------------------------- | |
825a46af | 367 | |
029190c5 PJ |
368 | The kernel scheduler (kernel/sched.c) automatically load balances |
369 | tasks. If one CPU is underutilized, kernel code running on that | |
370 | CPU will look for tasks on other more overloaded CPUs and move those | |
371 | tasks to itself, within the constraints of such placement mechanisms | |
372 | as cpusets and sched_setaffinity. | |
373 | ||
374 | The algorithmic cost of load balancing and its impact on key shared | |
375 | kernel data structures such as the task list increases more than | |
376 | linearly with the number of CPUs being balanced. So the scheduler | |
377 | has support to partition the systems CPUs into a number of sched | |
378 | domains such that it only load balances within each sched domain. | |
379 | Each sched domain covers some subset of the CPUs in the system; | |
380 | no two sched domains overlap; some CPUs might not be in any sched | |
381 | domain and hence won't be load balanced. | |
382 | ||
383 | Put simply, it costs less to balance between two smaller sched domains | |
384 | than one big one, but doing so means that overloads in one of the | |
385 | two domains won't be load balanced to the other one. | |
386 | ||
387 | By default, there is one sched domain covering all CPUs, except those | |
388 | marked isolated using the kernel boot time "isolcpus=" argument. | |
389 | ||
390 | This default load balancing across all CPUs is not well suited for | |
391 | the following two situations: | |
392 | 1) On large systems, load balancing across many CPUs is expensive. | |
393 | If the system is managed using cpusets to place independent jobs | |
394 | on separate sets of CPUs, full load balancing is unnecessary. | |
395 | 2) Systems supporting realtime on some CPUs need to minimize | |
396 | system overhead on those CPUs, including avoiding task load | |
397 | balancing if that is not needed. | |
398 | ||
399 | When the per-cpuset flag "sched_load_balance" is enabled (the default | |
400 | setting), it requests that all the CPUs in that cpusets allowed 'cpus' | |
401 | be contained in a single sched domain, ensuring that load balancing | |
402 | can move a task (not otherwised pinned, as by sched_setaffinity) | |
403 | from any CPU in that cpuset to any other. | |
404 | ||
405 | When the per-cpuset flag "sched_load_balance" is disabled, then the | |
406 | scheduler will avoid load balancing across the CPUs in that cpuset, | |
407 | --except-- in so far as is necessary because some overlapping cpuset | |
408 | has "sched_load_balance" enabled. | |
409 | ||
410 | So, for example, if the top cpuset has the flag "sched_load_balance" | |
411 | enabled, then the scheduler will have one sched domain covering all | |
412 | CPUs, and the setting of the "sched_load_balance" flag in any other | |
413 | cpusets won't matter, as we're already fully load balancing. | |
414 | ||
415 | Therefore in the above two situations, the top cpuset flag | |
416 | "sched_load_balance" should be disabled, and only some of the smaller, | |
417 | child cpusets have this flag enabled. | |
418 | ||
419 | When doing this, you don't usually want to leave any unpinned tasks in | |
420 | the top cpuset that might use non-trivial amounts of CPU, as such tasks | |
421 | may be artificially constrained to some subset of CPUs, depending on | |
422 | the particulars of this flag setting in descendent cpusets. Even if | |
423 | such a task could use spare CPU cycles in some other CPUs, the kernel | |
424 | scheduler might not consider the possibility of load balancing that | |
425 | task to that underused CPU. | |
426 | ||
427 | Of course, tasks pinned to a particular CPU can be left in a cpuset | |
428 | that disables "sched_load_balance" as those tasks aren't going anywhere | |
429 | else anyway. | |
430 | ||
431 | There is an impedance mismatch here, between cpusets and sched domains. | |
432 | Cpusets are hierarchical and nest. Sched domains are flat; they don't | |
433 | overlap and each CPU is in at most one sched domain. | |
434 | ||
435 | It is necessary for sched domains to be flat because load balancing | |
436 | across partially overlapping sets of CPUs would risk unstable dynamics | |
437 | that would be beyond our understanding. So if each of two partially | |
438 | overlapping cpusets enables the flag 'sched_load_balance', then we | |
439 | form a single sched domain that is a superset of both. We won't move | |
440 | a task to a CPU outside it cpuset, but the scheduler load balancing | |
441 | code might waste some compute cycles considering that possibility. | |
442 | ||
443 | This mismatch is why there is not a simple one-to-one relation | |
444 | between which cpusets have the flag "sched_load_balance" enabled, | |
445 | and the sched domain configuration. If a cpuset enables the flag, it | |
446 | will get balancing across all its CPUs, but if it disables the flag, | |
447 | it will only be assured of no load balancing if no other overlapping | |
448 | cpuset enables the flag. | |
449 | ||
450 | If two cpusets have partially overlapping 'cpus' allowed, and only | |
451 | one of them has this flag enabled, then the other may find its | |
452 | tasks only partially load balanced, just on the overlapping CPUs. | |
453 | This is just the general case of the top_cpuset example given a few | |
454 | paragraphs above. In the general case, as in the top cpuset case, | |
455 | don't leave tasks that might use non-trivial amounts of CPU in | |
456 | such partially load balanced cpusets, as they may be artificially | |
457 | constrained to some subset of the CPUs allowed to them, for lack of | |
458 | load balancing to the other CPUs. | |
459 | ||
460 | 1.7.1 sched_load_balance implementation details. | |
461 | ------------------------------------------------ | |
462 | ||
463 | The per-cpuset flag 'sched_load_balance' defaults to enabled (contrary | |
464 | to most cpuset flags.) When enabled for a cpuset, the kernel will | |
465 | ensure that it can load balance across all the CPUs in that cpuset | |
466 | (makes sure that all the CPUs in the cpus_allowed of that cpuset are | |
467 | in the same sched domain.) | |
468 | ||
469 | If two overlapping cpusets both have 'sched_load_balance' enabled, | |
470 | then they will be (must be) both in the same sched domain. | |
471 | ||
472 | If, as is the default, the top cpuset has 'sched_load_balance' enabled, | |
473 | then by the above that means there is a single sched domain covering | |
474 | the whole system, regardless of any other cpuset settings. | |
475 | ||
476 | The kernel commits to user space that it will avoid load balancing | |
477 | where it can. It will pick as fine a granularity partition of sched | |
478 | domains as it can while still providing load balancing for any set | |
479 | of CPUs allowed to a cpuset having 'sched_load_balance' enabled. | |
480 | ||
481 | The internal kernel cpuset to scheduler interface passes from the | |
482 | cpuset code to the scheduler code a partition of the load balanced | |
483 | CPUs in the system. This partition is a set of subsets (represented | |
484 | as an array of cpumask_t) of CPUs, pairwise disjoint, that cover all | |
485 | the CPUs that must be load balanced. | |
486 | ||
487 | Whenever the 'sched_load_balance' flag changes, or CPUs come or go | |
488 | from a cpuset with this flag enabled, or a cpuset with this flag | |
489 | enabled is removed, the cpuset code builds a new such partition and | |
490 | passes it to the scheduler sched domain setup code, to have the sched | |
491 | domains rebuilt as necessary. | |
492 | ||
493 | This partition exactly defines what sched domains the scheduler should | |
494 | setup - one sched domain for each element (cpumask_t) in the partition. | |
495 | ||
496 | The scheduler remembers the currently active sched domain partitions. | |
497 | When the scheduler routine partition_sched_domains() is invoked from | |
498 | the cpuset code to update these sched domains, it compares the new | |
499 | partition requested with the current, and updates its sched domains, | |
500 | removing the old and adding the new, for each change. | |
501 | ||
4d5f3553 HS |
502 | |
503 | 1.8 What is sched_relax_domain_level ? | |
504 | -------------------------------------- | |
505 | ||
506 | In sched domain, the scheduler migrates tasks in 2 ways; periodic load | |
507 | balance on tick, and at time of some schedule events. | |
508 | ||
509 | When a task is woken up, scheduler try to move the task on idle CPU. | |
510 | For example, if a task A running on CPU X activates another task B | |
511 | on the same CPU X, and if CPU Y is X's sibling and performing idle, | |
512 | then scheduler migrate task B to CPU Y so that task B can start on | |
513 | CPU Y without waiting task A on CPU X. | |
514 | ||
515 | And if a CPU run out of tasks in its runqueue, the CPU try to pull | |
516 | extra tasks from other busy CPUs to help them before it is going to | |
517 | be idle. | |
518 | ||
519 | Of course it takes some searching cost to find movable tasks and/or | |
520 | idle CPUs, the scheduler might not search all CPUs in the domain | |
521 | everytime. In fact, in some architectures, the searching ranges on | |
522 | events are limited in the same socket or node where the CPU locates, | |
523 | while the load balance on tick searchs all. | |
524 | ||
525 | For example, assume CPU Z is relatively far from CPU X. Even if CPU Z | |
526 | is idle while CPU X and the siblings are busy, scheduler can't migrate | |
527 | woken task B from X to Z since it is out of its searching range. | |
528 | As the result, task B on CPU X need to wait task A or wait load balance | |
529 | on the next tick. For some applications in special situation, waiting | |
530 | 1 tick may be too long. | |
531 | ||
532 | The 'sched_relax_domain_level' file allows you to request changing | |
533 | this searching range as you like. This file takes int value which | |
534 | indicates size of searching range in levels ideally as follows, | |
535 | otherwise initial value -1 that indicates the cpuset has no request. | |
536 | ||
537 | -1 : no request. use system default or follow request of others. | |
538 | 0 : no search. | |
539 | 1 : search siblings (hyperthreads in a core). | |
540 | 2 : search cores in a package. | |
541 | 3 : search cpus in a node [= system wide on non-NUMA system] | |
542 | ( 4 : search nodes in a chunk of node [on NUMA system] ) | |
543 | ( 5~ : search system wide [on NUMA system]) | |
544 | ||
545 | This file is per-cpuset and affect the sched domain where the cpuset | |
546 | belongs to. Therefore if the flag 'sched_load_balance' of a cpuset | |
547 | is disabled, then 'sched_relax_domain_level' have no effect since | |
548 | there is no sched domain belonging the cpuset. | |
549 | ||
550 | If multiple cpusets are overlapping and hence they form a single sched | |
551 | domain, the largest value among those is used. Be careful, if one | |
552 | requests 0 and others are -1 then 0 is used. | |
553 | ||
554 | Note that modifying this file will have both good and bad effects, | |
555 | and whether it is acceptable or not will be depend on your situation. | |
556 | Don't modify this file if you are not sure. | |
557 | ||
558 | If your situation is: | |
559 | - The migration costs between each cpu can be assumed considerably | |
560 | small(for you) due to your special application's behavior or | |
561 | special hardware support for CPU cache etc. | |
562 | - The searching cost doesn't have impact(for you) or you can make | |
563 | the searching cost enough small by managing cpuset to compact etc. | |
564 | - The latency is required even it sacrifices cache hit rate etc. | |
565 | then increasing 'sched_relax_domain_level' would benefit you. | |
566 | ||
567 | ||
568 | 1.9 How do I use cpusets ? | |
1da177e4 LT |
569 | -------------------------- |
570 | ||
571 | In order to minimize the impact of cpusets on critical kernel | |
572 | code, such as the scheduler, and due to the fact that the kernel | |
573 | does not support one task updating the memory placement of another | |
574 | task directly, the impact on a task of changing its cpuset CPU | |
575 | or Memory Node placement, or of changing to which cpuset a task | |
576 | is attached, is subtle. | |
577 | ||
578 | If a cpuset has its Memory Nodes modified, then for each task attached | |
579 | to that cpuset, the next time that the kernel attempts to allocate | |
580 | a page of memory for that task, the kernel will notice the change | |
581 | in the tasks cpuset, and update its per-task memory placement to | |
582 | remain within the new cpusets memory placement. If the task was using | |
583 | mempolicy MPOL_BIND, and the nodes to which it was bound overlap with | |
584 | its new cpuset, then the task will continue to use whatever subset | |
585 | of MPOL_BIND nodes are still allowed in the new cpuset. If the task | |
586 | was using MPOL_BIND and now none of its MPOL_BIND nodes are allowed | |
587 | in the new cpuset, then the task will be essentially treated as if it | |
588 | was MPOL_BIND bound to the new cpuset (even though its numa placement, | |
589 | as queried by get_mempolicy(), doesn't change). If a task is moved | |
590 | from one cpuset to another, then the kernel will adjust the tasks | |
591 | memory placement, as above, the next time that the kernel attempts | |
592 | to allocate a page of memory for that task. | |
593 | ||
8f5aa26c PJ |
594 | If a cpuset has its 'cpus' modified, then each task in that cpuset |
595 | will have its allowed CPU placement changed immediately. Similarly, | |
596 | if a tasks pid is written to a cpusets 'tasks' file, in either its | |
597 | current cpuset or another cpuset, then its allowed CPU placement is | |
598 | changed immediately. If such a task had been bound to some subset | |
599 | of its cpuset using the sched_setaffinity() call, the task will be | |
600 | allowed to run on any CPU allowed in its new cpuset, negating the | |
601 | affect of the prior sched_setaffinity() call. | |
1da177e4 LT |
602 | |
603 | In summary, the memory placement of a task whose cpuset is changed is | |
604 | updated by the kernel, on the next allocation of a page for that task, | |
605 | but the processor placement is not updated, until that tasks pid is | |
606 | rewritten to the 'tasks' file of its cpuset. This is done to avoid | |
607 | impacting the scheduler code in the kernel with a check for changes | |
608 | in a tasks processor placement. | |
609 | ||
45b07ef3 PJ |
610 | Normally, once a page is allocated (given a physical page |
611 | of main memory) then that page stays on whatever node it | |
612 | was allocated, so long as it remains allocated, even if the | |
613 | cpusets memory placement policy 'mems' subsequently changes. | |
614 | If the cpuset flag file 'memory_migrate' is set true, then when | |
615 | tasks are attached to that cpuset, any pages that task had | |
616 | allocated to it on nodes in its previous cpuset are migrated | |
b4fb3766 CL |
617 | to the tasks new cpuset. The relative placement of the page within |
618 | the cpuset is preserved during these migration operations if possible. | |
619 | For example if the page was on the second valid node of the prior cpuset | |
620 | then the page will be placed on the second valid node of the new cpuset. | |
621 | ||
45b07ef3 PJ |
622 | Also if 'memory_migrate' is set true, then if that cpusets |
623 | 'mems' file is modified, pages allocated to tasks in that | |
624 | cpuset, that were on nodes in the previous setting of 'mems', | |
b4fb3766 CL |
625 | will be moved to nodes in the new setting of 'mems.' |
626 | Pages that were not in the tasks prior cpuset, or in the cpusets | |
627 | prior 'mems' setting, will not be moved. | |
45b07ef3 | 628 | |
d533f671 | 629 | There is an exception to the above. If hotplug functionality is used |
1da177e4 LT |
630 | to remove all the CPUs that are currently assigned to a cpuset, |
631 | then the kernel will automatically update the cpus_allowed of all | |
b39c4fab | 632 | tasks attached to CPUs in that cpuset to allow all CPUs. When memory |
1da177e4 LT |
633 | hotplug functionality for removing Memory Nodes is available, a |
634 | similar exception is expected to apply there as well. In general, | |
635 | the kernel prefers to violate cpuset placement, over starving a task | |
636 | that has had all its allowed CPUs or Memory Nodes taken offline. User | |
637 | code should reconfigure cpusets to only refer to online CPUs and Memory | |
638 | Nodes when using hotplug to add or remove such resources. | |
639 | ||
640 | There is a second exception to the above. GFP_ATOMIC requests are | |
641 | kernel internal allocations that must be satisfied, immediately. | |
642 | The kernel may drop some request, in rare cases even panic, if a | |
643 | GFP_ATOMIC alloc fails. If the request cannot be satisfied within | |
644 | the current tasks cpuset, then we relax the cpuset, and look for | |
645 | memory anywhere we can find it. It's better to violate the cpuset | |
646 | than stress the kernel. | |
647 | ||
648 | To start a new job that is to be contained within a cpuset, the steps are: | |
649 | ||
650 | 1) mkdir /dev/cpuset | |
8793d854 | 651 | 2) mount -t cgroup -ocpuset cpuset /dev/cpuset |
1da177e4 LT |
652 | 3) Create the new cpuset by doing mkdir's and write's (or echo's) in |
653 | the /dev/cpuset virtual file system. | |
654 | 4) Start a task that will be the "founding father" of the new job. | |
655 | 5) Attach that task to the new cpuset by writing its pid to the | |
656 | /dev/cpuset tasks file for that cpuset. | |
657 | 6) fork, exec or clone the job tasks from this founding father task. | |
658 | ||
659 | For example, the following sequence of commands will setup a cpuset | |
660 | named "Charlie", containing just CPUs 2 and 3, and Memory Node 1, | |
661 | and then start a subshell 'sh' in that cpuset: | |
662 | ||
8793d854 | 663 | mount -t cgroup -ocpuset cpuset /dev/cpuset |
1da177e4 LT |
664 | cd /dev/cpuset |
665 | mkdir Charlie | |
666 | cd Charlie | |
667 | /bin/echo 2-3 > cpus | |
668 | /bin/echo 1 > mems | |
669 | /bin/echo $$ > tasks | |
670 | sh | |
671 | # The subshell 'sh' is now running in cpuset Charlie | |
672 | # The next line should display '/Charlie' | |
673 | cat /proc/self/cpuset | |
674 | ||
1da177e4 LT |
675 | In the future, a C library interface to cpusets will likely be |
676 | available. For now, the only way to query or modify cpusets is | |
677 | via the cpuset file system, using the various cd, mkdir, echo, cat, | |
678 | rmdir commands from the shell, or their equivalent from C. | |
679 | ||
680 | The sched_setaffinity calls can also be done at the shell prompt using | |
681 | SGI's runon or Robert Love's taskset. The mbind and set_mempolicy | |
682 | calls can be done at the shell prompt using the numactl command | |
683 | (part of Andi Kleen's numa package). | |
684 | ||
685 | 2. Usage Examples and Syntax | |
686 | ============================ | |
687 | ||
688 | 2.1 Basic Usage | |
689 | --------------- | |
690 | ||
691 | Creating, modifying, using the cpusets can be done through the cpuset | |
692 | virtual filesystem. | |
693 | ||
694 | To mount it, type: | |
8793d854 | 695 | # mount -t cgroup -o cpuset cpuset /dev/cpuset |
1da177e4 LT |
696 | |
697 | Then under /dev/cpuset you can find a tree that corresponds to the | |
698 | tree of the cpusets in the system. For instance, /dev/cpuset | |
699 | is the cpuset that holds the whole system. | |
700 | ||
701 | If you want to create a new cpuset under /dev/cpuset: | |
702 | # cd /dev/cpuset | |
703 | # mkdir my_cpuset | |
704 | ||
705 | Now you want to do something with this cpuset. | |
706 | # cd my_cpuset | |
707 | ||
708 | In this directory you can find several files: | |
709 | # ls | |
710 | cpus cpu_exclusive mems mem_exclusive tasks | |
711 | ||
712 | Reading them will give you information about the state of this cpuset: | |
713 | the CPUs and Memory Nodes it can use, the processes that are using | |
714 | it, its properties. By writing to these files you can manipulate | |
715 | the cpuset. | |
716 | ||
717 | Set some flags: | |
718 | # /bin/echo 1 > cpu_exclusive | |
719 | ||
720 | Add some cpus: | |
721 | # /bin/echo 0-7 > cpus | |
722 | ||
2400ff77 SH |
723 | Add some mems: |
724 | # /bin/echo 0-7 > mems | |
725 | ||
1da177e4 LT |
726 | Now attach your shell to this cpuset: |
727 | # /bin/echo $$ > tasks | |
728 | ||
729 | You can also create cpusets inside your cpuset by using mkdir in this | |
730 | directory. | |
731 | # mkdir my_sub_cs | |
732 | ||
733 | To remove a cpuset, just use rmdir: | |
734 | # rmdir my_sub_cs | |
735 | This will fail if the cpuset is in use (has cpusets inside, or has | |
736 | processes attached). | |
737 | ||
8793d854 PM |
738 | Note that for legacy reasons, the "cpuset" filesystem exists as a |
739 | wrapper around the cgroup filesystem. | |
740 | ||
741 | The command | |
742 | ||
743 | mount -t cpuset X /dev/cpuset | |
744 | ||
745 | is equivalent to | |
746 | ||
747 | mount -t cgroup -ocpuset X /dev/cpuset | |
748 | echo "/sbin/cpuset_release_agent" > /dev/cpuset/release_agent | |
749 | ||
1da177e4 LT |
750 | 2.2 Adding/removing cpus |
751 | ------------------------ | |
752 | ||
753 | This is the syntax to use when writing in the cpus or mems files | |
754 | in cpuset directories: | |
755 | ||
756 | # /bin/echo 1-4 > cpus -> set cpus list to cpus 1,2,3,4 | |
757 | # /bin/echo 1,2,3,4 > cpus -> set cpus list to cpus 1,2,3,4 | |
758 | ||
759 | 2.3 Setting flags | |
760 | ----------------- | |
761 | ||
762 | The syntax is very simple: | |
763 | ||
764 | # /bin/echo 1 > cpu_exclusive -> set flag 'cpu_exclusive' | |
765 | # /bin/echo 0 > cpu_exclusive -> unset flag 'cpu_exclusive' | |
766 | ||
767 | 2.4 Attaching processes | |
768 | ----------------------- | |
769 | ||
770 | # /bin/echo PID > tasks | |
771 | ||
772 | Note that it is PID, not PIDs. You can only attach ONE task at a time. | |
773 | If you have several tasks to attach, you have to do it one after another: | |
774 | ||
775 | # /bin/echo PID1 > tasks | |
776 | # /bin/echo PID2 > tasks | |
777 | ... | |
778 | # /bin/echo PIDn > tasks | |
779 | ||
780 | ||
781 | 3. Questions | |
782 | ============ | |
783 | ||
784 | Q: what's up with this '/bin/echo' ? | |
785 | A: bash's builtin 'echo' command does not check calls to write() against | |
786 | errors. If you use it in the cpuset file system, you won't be | |
787 | able to tell whether a command succeeded or failed. | |
788 | ||
789 | Q: When I attach processes, only the first of the line gets really attached ! | |
790 | A: We can only return one error code per call to write(). So you should also | |
791 | put only ONE pid. | |
792 | ||
793 | 4. Contact | |
794 | ========== | |
795 | ||
796 | Web: http://www.bullopensource.org/cpuset |