cpusets.txt 23 KB

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