cpusets.txt 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540
  1. CPUSETS
  2. -------
  3. Copyright (C) 2004 BULL SA.
  4. Written by Simon.Derr@bull.net
  5. Portions Copyright (c) 2004-2006 Silicon Graphics, Inc.
  6. Modified by Paul Jackson <pj@sgi.com>
  7. Modified by Christoph Lameter <clameter@sgi.com>
  8. CONTENTS:
  9. =========
  10. 1. Cpusets
  11. 1.1 What are cpusets ?
  12. 1.2 Why are cpusets needed ?
  13. 1.3 How are cpusets implemented ?
  14. 1.4 What are exclusive cpusets ?
  15. 1.5 What does notify_on_release do ?
  16. 1.6 What is memory_pressure ?
  17. 1.7 How do I use cpusets ?
  18. 2. Usage Examples and Syntax
  19. 2.1 Basic Usage
  20. 2.2 Adding/removing cpus
  21. 2.3 Setting flags
  22. 2.4 Attaching processes
  23. 3. Questions
  24. 4. Contact
  25. 1. Cpusets
  26. ==========
  27. 1.1 What are cpusets ?
  28. ----------------------
  29. Cpusets provide a mechanism for assigning a set of CPUs and Memory
  30. Nodes to a set of tasks.
  31. Cpusets constrain the CPU and Memory placement of tasks to only
  32. the resources within a tasks current cpuset. They form a nested
  33. hierarchy visible in a virtual file system. These are the essential
  34. hooks, beyond what is already present, required to manage dynamic
  35. job placement on large systems.
  36. Each task has a pointer to a cpuset. Multiple tasks may reference
  37. the same cpuset. Requests by a task, using the sched_setaffinity(2)
  38. system call to include CPUs in its CPU affinity mask, and using the
  39. mbind(2) and set_mempolicy(2) system calls to include Memory Nodes
  40. in its memory policy, are both filtered through that tasks cpuset,
  41. filtering out any CPUs or Memory Nodes not in that cpuset. The
  42. scheduler will not schedule a task on a CPU that is not allowed in
  43. its cpus_allowed vector, and the kernel page allocator will not
  44. allocate a page on a node that is not allowed in the requesting tasks
  45. mems_allowed vector.
  46. User level code may create and destroy cpusets by name in the cpuset
  47. virtual file system, manage the attributes and permissions of these
  48. cpusets and which CPUs and Memory Nodes are assigned to each cpuset,
  49. specify and query to which cpuset a task is assigned, and list the
  50. task pids assigned to a cpuset.
  51. 1.2 Why are cpusets needed ?
  52. ----------------------------
  53. The management of large computer systems, with many processors (CPUs),
  54. complex memory cache hierarchies and multiple Memory Nodes having
  55. non-uniform access times (NUMA) presents additional challenges for
  56. the efficient scheduling and memory placement of processes.
  57. Frequently more modest sized systems can be operated with adequate
  58. efficiency just by letting the operating system automatically share
  59. the available CPU and Memory resources amongst the requesting tasks.
  60. But larger systems, which benefit more from careful processor and
  61. memory placement to reduce memory access times and contention,
  62. and which typically represent a larger investment for the customer,
  63. can benefit from explicitly placing jobs on properly sized subsets of
  64. the system.
  65. This can be especially valuable on:
  66. * Web Servers running multiple instances of the same web application,
  67. * Servers running different applications (for instance, a web server
  68. and a database), or
  69. * NUMA systems running large HPC applications with demanding
  70. performance characteristics.
  71. * Also cpu_exclusive cpusets are useful for servers running orthogonal
  72. workloads such as RT applications requiring low latency and HPC
  73. applications that are throughput sensitive
  74. These subsets, or "soft partitions" must be able to be dynamically
  75. adjusted, as the job mix changes, without impacting other concurrently
  76. executing jobs. The location of the running jobs pages may also be moved
  77. when the memory locations are changed.
  78. The kernel cpuset patch provides the minimum essential kernel
  79. mechanisms required to efficiently implement such subsets. It
  80. leverages existing CPU and Memory Placement facilities in the Linux
  81. kernel to avoid any additional impact on the critical scheduler or
  82. memory allocator code.
  83. 1.3 How are cpusets implemented ?
  84. ---------------------------------
  85. Cpusets provide a Linux kernel mechanism to constrain which CPUs and
  86. Memory Nodes are used by a process or set of processes.
  87. The Linux kernel already has a pair of mechanisms to specify on which
  88. CPUs a task may be scheduled (sched_setaffinity) and on which Memory
  89. Nodes it may obtain memory (mbind, set_mempolicy).
  90. Cpusets extends these two mechanisms as follows:
  91. - Cpusets are sets of allowed CPUs and Memory Nodes, known to the
  92. kernel.
  93. - Each task in the system is attached to a cpuset, via a pointer
  94. in the task structure to a reference counted cpuset structure.
  95. - Calls to sched_setaffinity are filtered to just those CPUs
  96. allowed in that tasks cpuset.
  97. - Calls to mbind and set_mempolicy are filtered to just
  98. those Memory Nodes allowed in that tasks cpuset.
  99. - The root cpuset contains all the systems CPUs and Memory
  100. Nodes.
  101. - For any cpuset, one can define child cpusets containing a subset
  102. of the parents CPU and Memory Node resources.
  103. - The hierarchy of cpusets can be mounted at /dev/cpuset, for
  104. browsing and manipulation from user space.
  105. - A cpuset may be marked exclusive, which ensures that no other
  106. cpuset (except direct ancestors and descendents) may contain
  107. any overlapping CPUs or Memory Nodes.
  108. Also a cpu_exclusive cpuset would be associated with a sched
  109. domain.
  110. - You can list all the tasks (by pid) attached to any cpuset.
  111. The implementation of cpusets requires a few, simple hooks
  112. into the rest of the kernel, none in performance critical paths:
  113. - in init/main.c, to initialize the root cpuset at system boot.
  114. - in fork and exit, to attach and detach a task from its cpuset.
  115. - in sched_setaffinity, to mask the requested CPUs by what's
  116. allowed in that tasks cpuset.
  117. - in sched.c migrate_all_tasks(), to keep migrating tasks within
  118. the CPUs allowed by their cpuset, if possible.
  119. - in sched.c, a new API partition_sched_domains for handling
  120. sched domain changes associated with cpu_exclusive cpusets
  121. and related changes in both sched.c and arch/ia64/kernel/domain.c
  122. - in the mbind and set_mempolicy system calls, to mask the requested
  123. Memory Nodes by what's allowed in that tasks cpuset.
  124. - in page_alloc.c, to restrict memory to allowed nodes.
  125. - in vmscan.c, to restrict page recovery to the current cpuset.
  126. In addition a new file system, of type "cpuset" may be mounted,
  127. typically at /dev/cpuset, to enable browsing and modifying the cpusets
  128. presently known to the kernel. No new system calls are added for
  129. cpusets - all support for querying and modifying cpusets is via
  130. this cpuset file system.
  131. Each task under /proc has an added file named 'cpuset', displaying
  132. the cpuset name, as the path relative to the root of the cpuset file
  133. system.
  134. The /proc/<pid>/status file for each task has two added lines,
  135. displaying the tasks cpus_allowed (on which CPUs it may be scheduled)
  136. and mems_allowed (on which Memory Nodes it may obtain memory),
  137. in the format seen in the following example:
  138. Cpus_allowed: ffffffff,ffffffff,ffffffff,ffffffff
  139. Mems_allowed: ffffffff,ffffffff
  140. Each cpuset is represented by a directory in the cpuset file system
  141. containing the following files describing that cpuset:
  142. - cpus: list of CPUs in that cpuset
  143. - mems: list of Memory Nodes in that cpuset
  144. - memory_migrate flag: if set, move pages to cpusets nodes
  145. - cpu_exclusive flag: is cpu placement exclusive?
  146. - mem_exclusive flag: is memory placement exclusive?
  147. - tasks: list of tasks (by pid) attached to that cpuset
  148. - notify_on_release flag: run /sbin/cpuset_release_agent on exit?
  149. - memory_pressure: measure of how much paging pressure in cpuset
  150. In addition, the root cpuset only has the following file:
  151. - memory_pressure_enabled flag: compute memory_pressure?
  152. New cpusets are created using the mkdir system call or shell
  153. command. The properties of a cpuset, such as its flags, allowed
  154. CPUs and Memory Nodes, and attached tasks, are modified by writing
  155. to the appropriate file in that cpusets directory, as listed above.
  156. The named hierarchical structure of nested cpusets allows partitioning
  157. a large system into nested, dynamically changeable, "soft-partitions".
  158. The attachment of each task, automatically inherited at fork by any
  159. children of that task, to a cpuset allows organizing the work load
  160. on a system into related sets of tasks such that each set is constrained
  161. to using the CPUs and Memory Nodes of a particular cpuset. A task
  162. may be re-attached to any other cpuset, if allowed by the permissions
  163. on the necessary cpuset file system directories.
  164. Such management of a system "in the large" integrates smoothly with
  165. the detailed placement done on individual tasks and memory regions
  166. using the sched_setaffinity, mbind and set_mempolicy system calls.
  167. The following rules apply to each cpuset:
  168. - Its CPUs and Memory Nodes must be a subset of its parents.
  169. - It can only be marked exclusive if its parent is.
  170. - If its cpu or memory is exclusive, they may not overlap any sibling.
  171. These rules, and the natural hierarchy of cpusets, enable efficient
  172. enforcement of the exclusive guarantee, without having to scan all
  173. cpusets every time any of them change to ensure nothing overlaps a
  174. exclusive cpuset. Also, the use of a Linux virtual file system (vfs)
  175. to represent the cpuset hierarchy provides for a familiar permission
  176. and name space for cpusets, with a minimum of additional kernel code.
  177. 1.4 What are exclusive cpusets ?
  178. --------------------------------
  179. If a cpuset is cpu or mem exclusive, no other cpuset, other than
  180. a direct ancestor or descendent, may share any of the same CPUs or
  181. Memory Nodes.
  182. A cpuset that is cpu_exclusive has a scheduler (sched) domain
  183. associated with it. The sched domain consists of all CPUs in the
  184. current cpuset that are not part of any exclusive child cpusets.
  185. This ensures that the scheduler load balancing code only balances
  186. against the CPUs that are in the sched domain as defined above and
  187. not all of the CPUs in the system. This removes any overhead due to
  188. load balancing code trying to pull tasks outside of the cpu_exclusive
  189. cpuset only to be prevented by the tasks' cpus_allowed mask.
  190. A cpuset that is mem_exclusive restricts kernel allocations for
  191. page, buffer and other data commonly shared by the kernel across
  192. multiple users. All cpusets, whether mem_exclusive or not, restrict
  193. allocations of memory for user space. This enables configuring a
  194. system so that several independent jobs can share common kernel data,
  195. such as file system pages, while isolating each jobs user allocation in
  196. its own cpuset. To do this, construct a large mem_exclusive cpuset to
  197. hold all the jobs, and construct child, non-mem_exclusive cpusets for
  198. each individual job. Only a small amount of typical kernel memory,
  199. such as requests from interrupt handlers, is allowed to be taken
  200. outside even a mem_exclusive cpuset.
  201. 1.5 What does notify_on_release do ?
  202. ------------------------------------
  203. If the notify_on_release flag is enabled (1) in a cpuset, then whenever
  204. the last task in the cpuset leaves (exits or attaches to some other
  205. cpuset) and the last child cpuset of that cpuset is removed, then
  206. the kernel runs the command /sbin/cpuset_release_agent, supplying the
  207. pathname (relative to the mount point of the cpuset file system) of the
  208. abandoned cpuset. This enables automatic removal of abandoned cpusets.
  209. The default value of notify_on_release in the root cpuset at system
  210. boot is disabled (0). The default value of other cpusets at creation
  211. is the current value of their parents notify_on_release setting.
  212. 1.6 What is memory_pressure ?
  213. -----------------------------
  214. The memory_pressure of a cpuset provides a simple per-cpuset metric
  215. of the rate that the tasks in a cpuset are attempting to free up in
  216. use memory on the nodes of the cpuset to satisfy additional memory
  217. requests.
  218. This enables batch managers monitoring jobs running in dedicated
  219. cpusets to efficiently detect what level of memory pressure that job
  220. is causing.
  221. This is useful both on tightly managed systems running a wide mix of
  222. submitted jobs, which may choose to terminate or re-prioritize jobs that
  223. are trying to use more memory than allowed on the nodes assigned them,
  224. and with tightly coupled, long running, massively parallel scientific
  225. computing jobs that will dramatically fail to meet required performance
  226. goals if they start to use more memory than allowed to them.
  227. This mechanism provides a very economical way for the batch manager
  228. to monitor a cpuset for signs of memory pressure. It's up to the
  229. batch manager or other user code to decide what to do about it and
  230. take action.
  231. ==> Unless this feature is enabled by writing "1" to the special file
  232. /dev/cpuset/memory_pressure_enabled, the hook in the rebalance
  233. code of __alloc_pages() for this metric reduces to simply noticing
  234. that the cpuset_memory_pressure_enabled flag is zero. So only
  235. systems that enable this feature will compute the metric.
  236. Why a per-cpuset, running average:
  237. Because this meter is per-cpuset, rather than per-task or mm,
  238. the system load imposed by a batch scheduler monitoring this
  239. metric is sharply reduced on large systems, because a scan of
  240. the tasklist can be avoided on each set of queries.
  241. Because this meter is a running average, instead of an accumulating
  242. counter, a batch scheduler can detect memory pressure with a
  243. single read, instead of having to read and accumulate results
  244. for a period of time.
  245. Because this meter is per-cpuset rather than per-task or mm,
  246. the batch scheduler can obtain the key information, memory
  247. pressure in a cpuset, with a single read, rather than having to
  248. query and accumulate results over all the (dynamically changing)
  249. set of tasks in the cpuset.
  250. A per-cpuset simple digital filter (requires a spinlock and 3 words
  251. of data per-cpuset) is kept, and updated by any task attached to that
  252. cpuset, if it enters the synchronous (direct) page reclaim code.
  253. A per-cpuset file provides an integer number representing the recent
  254. (half-life of 10 seconds) rate of direct page reclaims caused by
  255. the tasks in the cpuset, in units of reclaims attempted per second,
  256. times 1000.
  257. 1.7 How do I use cpusets ?
  258. --------------------------
  259. In order to minimize the impact of cpusets on critical kernel
  260. code, such as the scheduler, and due to the fact that the kernel
  261. does not support one task updating the memory placement of another
  262. task directly, the impact on a task of changing its cpuset CPU
  263. or Memory Node placement, or of changing to which cpuset a task
  264. is attached, is subtle.
  265. If a cpuset has its Memory Nodes modified, then for each task attached
  266. to that cpuset, the next time that the kernel attempts to allocate
  267. a page of memory for that task, the kernel will notice the change
  268. in the tasks cpuset, and update its per-task memory placement to
  269. remain within the new cpusets memory placement. If the task was using
  270. mempolicy MPOL_BIND, and the nodes to which it was bound overlap with
  271. its new cpuset, then the task will continue to use whatever subset
  272. of MPOL_BIND nodes are still allowed in the new cpuset. If the task
  273. was using MPOL_BIND and now none of its MPOL_BIND nodes are allowed
  274. in the new cpuset, then the task will be essentially treated as if it
  275. was MPOL_BIND bound to the new cpuset (even though its numa placement,
  276. as queried by get_mempolicy(), doesn't change). If a task is moved
  277. from one cpuset to another, then the kernel will adjust the tasks
  278. memory placement, as above, the next time that the kernel attempts
  279. to allocate a page of memory for that task.
  280. If a cpuset has its CPUs modified, then each task using that
  281. cpuset does _not_ change its behavior automatically. In order to
  282. minimize the impact on the critical scheduling code in the kernel,
  283. tasks will continue to use their prior CPU placement until they
  284. are rebound to their cpuset, by rewriting their pid to the 'tasks'
  285. file of their cpuset. If a task had been bound to some subset of its
  286. cpuset using the sched_setaffinity() call, and if any of that subset
  287. is still allowed in its new cpuset settings, then the task will be
  288. restricted to the intersection of the CPUs it was allowed on before,
  289. and its new cpuset CPU placement. If, on the other hand, there is
  290. no overlap between a tasks prior placement and its new cpuset CPU
  291. placement, then the task will be allowed to run on any CPU allowed
  292. in its new cpuset. If a task is moved from one cpuset to another,
  293. its CPU placement is updated in the same way as if the tasks pid is
  294. rewritten to the 'tasks' file of its current cpuset.
  295. In summary, the memory placement of a task whose cpuset is changed is
  296. updated by the kernel, on the next allocation of a page for that task,
  297. but the processor placement is not updated, until that tasks pid is
  298. rewritten to the 'tasks' file of its cpuset. This is done to avoid
  299. impacting the scheduler code in the kernel with a check for changes
  300. in a tasks processor placement.
  301. Normally, once a page is allocated (given a physical page
  302. of main memory) then that page stays on whatever node it
  303. was allocated, so long as it remains allocated, even if the
  304. cpusets memory placement policy 'mems' subsequently changes.
  305. If the cpuset flag file 'memory_migrate' is set true, then when
  306. tasks are attached to that cpuset, any pages that task had
  307. allocated to it on nodes in its previous cpuset are migrated
  308. to the tasks new cpuset. The relative placement of the page within
  309. the cpuset is preserved during these migration operations if possible.
  310. For example if the page was on the second valid node of the prior cpuset
  311. then the page will be placed on the second valid node of the new cpuset.
  312. Also if 'memory_migrate' is set true, then if that cpusets
  313. 'mems' file is modified, pages allocated to tasks in that
  314. cpuset, that were on nodes in the previous setting of 'mems',
  315. will be moved to nodes in the new setting of 'mems.'
  316. Pages that were not in the tasks prior cpuset, or in the cpusets
  317. prior 'mems' setting, will not be moved.
  318. There is an exception to the above. If hotplug functionality is used
  319. to remove all the CPUs that are currently assigned to a cpuset,
  320. then the kernel will automatically update the cpus_allowed of all
  321. tasks attached to CPUs in that cpuset to allow all CPUs. When memory
  322. hotplug functionality for removing Memory Nodes is available, a
  323. similar exception is expected to apply there as well. In general,
  324. the kernel prefers to violate cpuset placement, over starving a task
  325. that has had all its allowed CPUs or Memory Nodes taken offline. User
  326. code should reconfigure cpusets to only refer to online CPUs and Memory
  327. Nodes when using hotplug to add or remove such resources.
  328. There is a second exception to the above. GFP_ATOMIC requests are
  329. kernel internal allocations that must be satisfied, immediately.
  330. The kernel may drop some request, in rare cases even panic, if a
  331. GFP_ATOMIC alloc fails. If the request cannot be satisfied within
  332. the current tasks cpuset, then we relax the cpuset, and look for
  333. memory anywhere we can find it. It's better to violate the cpuset
  334. than stress the kernel.
  335. To start a new job that is to be contained within a cpuset, the steps are:
  336. 1) mkdir /dev/cpuset
  337. 2) mount -t cpuset none /dev/cpuset
  338. 3) Create the new cpuset by doing mkdir's and write's (or echo's) in
  339. the /dev/cpuset virtual file system.
  340. 4) Start a task that will be the "founding father" of the new job.
  341. 5) Attach that task to the new cpuset by writing its pid to the
  342. /dev/cpuset tasks file for that cpuset.
  343. 6) fork, exec or clone the job tasks from this founding father task.
  344. For example, the following sequence of commands will setup a cpuset
  345. named "Charlie", containing just CPUs 2 and 3, and Memory Node 1,
  346. and then start a subshell 'sh' in that cpuset:
  347. mount -t cpuset none /dev/cpuset
  348. cd /dev/cpuset
  349. mkdir Charlie
  350. cd Charlie
  351. /bin/echo 2-3 > cpus
  352. /bin/echo 1 > mems
  353. /bin/echo $$ > tasks
  354. sh
  355. # The subshell 'sh' is now running in cpuset Charlie
  356. # The next line should display '/Charlie'
  357. cat /proc/self/cpuset
  358. In the future, a C library interface to cpusets will likely be
  359. available. For now, the only way to query or modify cpusets is
  360. via the cpuset file system, using the various cd, mkdir, echo, cat,
  361. rmdir commands from the shell, or their equivalent from C.
  362. The sched_setaffinity calls can also be done at the shell prompt using
  363. SGI's runon or Robert Love's taskset. The mbind and set_mempolicy
  364. calls can be done at the shell prompt using the numactl command
  365. (part of Andi Kleen's numa package).
  366. 2. Usage Examples and Syntax
  367. ============================
  368. 2.1 Basic Usage
  369. ---------------
  370. Creating, modifying, using the cpusets can be done through the cpuset
  371. virtual filesystem.
  372. To mount it, type:
  373. # mount -t cpuset none /dev/cpuset
  374. Then under /dev/cpuset you can find a tree that corresponds to the
  375. tree of the cpusets in the system. For instance, /dev/cpuset
  376. is the cpuset that holds the whole system.
  377. If you want to create a new cpuset under /dev/cpuset:
  378. # cd /dev/cpuset
  379. # mkdir my_cpuset
  380. Now you want to do something with this cpuset.
  381. # cd my_cpuset
  382. In this directory you can find several files:
  383. # ls
  384. cpus cpu_exclusive mems mem_exclusive tasks
  385. Reading them will give you information about the state of this cpuset:
  386. the CPUs and Memory Nodes it can use, the processes that are using
  387. it, its properties. By writing to these files you can manipulate
  388. the cpuset.
  389. Set some flags:
  390. # /bin/echo 1 > cpu_exclusive
  391. Add some cpus:
  392. # /bin/echo 0-7 > cpus
  393. Now attach your shell to this cpuset:
  394. # /bin/echo $$ > tasks
  395. You can also create cpusets inside your cpuset by using mkdir in this
  396. directory.
  397. # mkdir my_sub_cs
  398. To remove a cpuset, just use rmdir:
  399. # rmdir my_sub_cs
  400. This will fail if the cpuset is in use (has cpusets inside, or has
  401. processes attached).
  402. 2.2 Adding/removing cpus
  403. ------------------------
  404. This is the syntax to use when writing in the cpus or mems files
  405. in cpuset directories:
  406. # /bin/echo 1-4 > cpus -> set cpus list to cpus 1,2,3,4
  407. # /bin/echo 1,2,3,4 > cpus -> set cpus list to cpus 1,2,3,4
  408. 2.3 Setting flags
  409. -----------------
  410. The syntax is very simple:
  411. # /bin/echo 1 > cpu_exclusive -> set flag 'cpu_exclusive'
  412. # /bin/echo 0 > cpu_exclusive -> unset flag 'cpu_exclusive'
  413. 2.4 Attaching processes
  414. -----------------------
  415. # /bin/echo PID > tasks
  416. Note that it is PID, not PIDs. You can only attach ONE task at a time.
  417. If you have several tasks to attach, you have to do it one after another:
  418. # /bin/echo PID1 > tasks
  419. # /bin/echo PID2 > tasks
  420. ...
  421. # /bin/echo PIDn > tasks
  422. 3. Questions
  423. ============
  424. Q: what's up with this '/bin/echo' ?
  425. A: bash's builtin 'echo' command does not check calls to write() against
  426. errors. If you use it in the cpuset file system, you won't be
  427. able to tell whether a command succeeded or failed.
  428. Q: When I attach processes, only the first of the line gets really attached !
  429. A: We can only return one error code per call to write(). So you should also
  430. put only ONE pid.
  431. 4. Contact
  432. ==========
  433. Web: http://www.bullopensource.org/cpuset