6 :Author: Tejun Heo <tj@kernel.org>
8 This is the authoritative documentation on the design, interface and
9 conventions of cgroup v2. It describes all userland-visible aspects
10 of cgroup including core and specific controller behaviors. All
11 future changes must be reflected in this document. Documentation for
12 v1 is available under Documentation/cgroup-v1/.
21 2-2. Organizing Processes and Threads
24 2-3. [Un]populated Notification
25 2-4. Controlling Controllers
26 2-4-1. Enabling and Disabling
27 2-4-2. Top-down Constraint
28 2-4-3. No Internal Process Constraint
30 2-5-1. Model of Delegation
31 2-5-2. Delegation Containment
33 2-6-1. Organize Once and Control
34 2-6-2. Avoid Name Collisions
35 3. Resource Distribution Models
43 4-3. Core Interface Files
46 5-1-1. CPU Interface Files
48 5-2-1. Memory Interface Files
49 5-2-2. Usage Guidelines
50 5-2-3. Memory Ownership
52 5-3-1. IO Interface Files
55 5-3-3-1. How IO Latency Throttling Works
56 5-3-3-2. IO Latency Interface Files
58 5-4-1. PID Interface Files
61 5-6-1. RDMA Interface Files
64 5-N. Non-normative information
65 5-N-1. CPU controller root cgroup process behaviour
66 5-N-2. IO controller root cgroup process behaviour
69 6-2. The Root and Views
70 6-3. Migration and setns(2)
71 6-4. Interaction with Other Namespaces
72 P. Information on Kernel Programming
73 P-1. Filesystem Support for Writeback
74 D. Deprecated v1 Core Features
75 R. Issues with v1 and Rationales for v2
76 R-1. Multiple Hierarchies
77 R-2. Thread Granularity
78 R-3. Competition Between Inner Nodes and Threads
79 R-4. Other Interface Issues
80 R-5. Controller Issues and Remedies
90 "cgroup" stands for "control group" and is never capitalized. The
91 singular form is used to designate the whole feature and also as a
92 qualifier as in "cgroup controllers". When explicitly referring to
93 multiple individual control groups, the plural form "cgroups" is used.
99 cgroup is a mechanism to organize processes hierarchically and
100 distribute system resources along the hierarchy in a controlled and
103 cgroup is largely composed of two parts - the core and controllers.
104 cgroup core is primarily responsible for hierarchically organizing
105 processes. A cgroup controller is usually responsible for
106 distributing a specific type of system resource along the hierarchy
107 although there are utility controllers which serve purposes other than
108 resource distribution.
110 cgroups form a tree structure and every process in the system belongs
111 to one and only one cgroup. All threads of a process belong to the
112 same cgroup. On creation, all processes are put in the cgroup that
113 the parent process belongs to at the time. A process can be migrated
114 to another cgroup. Migration of a process doesn't affect already
115 existing descendant processes.
117 Following certain structural constraints, controllers may be enabled or
118 disabled selectively on a cgroup. All controller behaviors are
119 hierarchical - if a controller is enabled on a cgroup, it affects all
120 processes which belong to the cgroups consisting the inclusive
121 sub-hierarchy of the cgroup. When a controller is enabled on a nested
122 cgroup, it always restricts the resource distribution further. The
123 restrictions set closer to the root in the hierarchy can not be
124 overridden from further away.
133 Unlike v1, cgroup v2 has only single hierarchy. The cgroup v2
134 hierarchy can be mounted with the following mount command::
136 # mount -t cgroup2 none $MOUNT_POINT
138 cgroup2 filesystem has the magic number 0x63677270 ("cgrp"). All
139 controllers which support v2 and are not bound to a v1 hierarchy are
140 automatically bound to the v2 hierarchy and show up at the root.
141 Controllers which are not in active use in the v2 hierarchy can be
142 bound to other hierarchies. This allows mixing v2 hierarchy with the
143 legacy v1 multiple hierarchies in a fully backward compatible way.
145 A controller can be moved across hierarchies only after the controller
146 is no longer referenced in its current hierarchy. Because per-cgroup
147 controller states are destroyed asynchronously and controllers may
148 have lingering references, a controller may not show up immediately on
149 the v2 hierarchy after the final umount of the previous hierarchy.
150 Similarly, a controller should be fully disabled to be moved out of
151 the unified hierarchy and it may take some time for the disabled
152 controller to become available for other hierarchies; furthermore, due
153 to inter-controller dependencies, other controllers may need to be
156 While useful for development and manual configurations, moving
157 controllers dynamically between the v2 and other hierarchies is
158 strongly discouraged for production use. It is recommended to decide
159 the hierarchies and controller associations before starting using the
160 controllers after system boot.
162 During transition to v2, system management software might still
163 automount the v1 cgroup filesystem and so hijack all controllers
164 during boot, before manual intervention is possible. To make testing
165 and experimenting easier, the kernel parameter cgroup_no_v1= allows
166 disabling controllers in v1 and make them always available in v2.
168 cgroup v2 currently supports the following mount options.
172 Consider cgroup namespaces as delegation boundaries. This
173 option is system wide and can only be set on mount or modified
174 through remount from the init namespace. The mount option is
175 ignored on non-init namespace mounts. Please refer to the
176 Delegation section for details.
179 Organizing Processes and Threads
180 --------------------------------
185 Initially, only the root cgroup exists to which all processes belong.
186 A child cgroup can be created by creating a sub-directory::
190 A given cgroup may have multiple child cgroups forming a tree
191 structure. Each cgroup has a read-writable interface file
192 "cgroup.procs". When read, it lists the PIDs of all processes which
193 belong to the cgroup one-per-line. The PIDs are not ordered and the
194 same PID may show up more than once if the process got moved to
195 another cgroup and then back or the PID got recycled while reading.
197 A process can be migrated into a cgroup by writing its PID to the
198 target cgroup's "cgroup.procs" file. Only one process can be migrated
199 on a single write(2) call. If a process is composed of multiple
200 threads, writing the PID of any thread migrates all threads of the
203 When a process forks a child process, the new process is born into the
204 cgroup that the forking process belongs to at the time of the
205 operation. After exit, a process stays associated with the cgroup
206 that it belonged to at the time of exit until it's reaped; however, a
207 zombie process does not appear in "cgroup.procs" and thus can't be
208 moved to another cgroup.
210 A cgroup which doesn't have any children or live processes can be
211 destroyed by removing the directory. Note that a cgroup which doesn't
212 have any children and is associated only with zombie processes is
213 considered empty and can be removed::
217 "/proc/$PID/cgroup" lists a process's cgroup membership. If legacy
218 cgroup is in use in the system, this file may contain multiple lines,
219 one for each hierarchy. The entry for cgroup v2 is always in the
222 # cat /proc/842/cgroup
224 0::/test-cgroup/test-cgroup-nested
226 If the process becomes a zombie and the cgroup it was associated with
227 is removed subsequently, " (deleted)" is appended to the path::
229 # cat /proc/842/cgroup
231 0::/test-cgroup/test-cgroup-nested (deleted)
237 cgroup v2 supports thread granularity for a subset of controllers to
238 support use cases requiring hierarchical resource distribution across
239 the threads of a group of processes. By default, all threads of a
240 process belong to the same cgroup, which also serves as the resource
241 domain to host resource consumptions which are not specific to a
242 process or thread. The thread mode allows threads to be spread across
243 a subtree while still maintaining the common resource domain for them.
245 Controllers which support thread mode are called threaded controllers.
246 The ones which don't are called domain controllers.
248 Marking a cgroup threaded makes it join the resource domain of its
249 parent as a threaded cgroup. The parent may be another threaded
250 cgroup whose resource domain is further up in the hierarchy. The root
251 of a threaded subtree, that is, the nearest ancestor which is not
252 threaded, is called threaded domain or thread root interchangeably and
253 serves as the resource domain for the entire subtree.
255 Inside a threaded subtree, threads of a process can be put in
256 different cgroups and are not subject to the no internal process
257 constraint - threaded controllers can be enabled on non-leaf cgroups
258 whether they have threads in them or not.
260 As the threaded domain cgroup hosts all the domain resource
261 consumptions of the subtree, it is considered to have internal
262 resource consumptions whether there are processes in it or not and
263 can't have populated child cgroups which aren't threaded. Because the
264 root cgroup is not subject to no internal process constraint, it can
265 serve both as a threaded domain and a parent to domain cgroups.
267 The current operation mode or type of the cgroup is shown in the
268 "cgroup.type" file which indicates whether the cgroup is a normal
269 domain, a domain which is serving as the domain of a threaded subtree,
270 or a threaded cgroup.
272 On creation, a cgroup is always a domain cgroup and can be made
273 threaded by writing "threaded" to the "cgroup.type" file. The
274 operation is single direction::
276 # echo threaded > cgroup.type
278 Once threaded, the cgroup can't be made a domain again. To enable the
279 thread mode, the following conditions must be met.
281 - As the cgroup will join the parent's resource domain. The parent
282 must either be a valid (threaded) domain or a threaded cgroup.
284 - When the parent is an unthreaded domain, it must not have any domain
285 controllers enabled or populated domain children. The root is
286 exempt from this requirement.
288 Topology-wise, a cgroup can be in an invalid state. Please consider
289 the following topology::
291 A (threaded domain) - B (threaded) - C (domain, just created)
293 C is created as a domain but isn't connected to a parent which can
294 host child domains. C can't be used until it is turned into a
295 threaded cgroup. "cgroup.type" file will report "domain (invalid)" in
296 these cases. Operations which fail due to invalid topology use
297 EOPNOTSUPP as the errno.
299 A domain cgroup is turned into a threaded domain when one of its child
300 cgroup becomes threaded or threaded controllers are enabled in the
301 "cgroup.subtree_control" file while there are processes in the cgroup.
302 A threaded domain reverts to a normal domain when the conditions
305 When read, "cgroup.threads" contains the list of the thread IDs of all
306 threads in the cgroup. Except that the operations are per-thread
307 instead of per-process, "cgroup.threads" has the same format and
308 behaves the same way as "cgroup.procs". While "cgroup.threads" can be
309 written to in any cgroup, as it can only move threads inside the same
310 threaded domain, its operations are confined inside each threaded
313 The threaded domain cgroup serves as the resource domain for the whole
314 subtree, and, while the threads can be scattered across the subtree,
315 all the processes are considered to be in the threaded domain cgroup.
316 "cgroup.procs" in a threaded domain cgroup contains the PIDs of all
317 processes in the subtree and is not readable in the subtree proper.
318 However, "cgroup.procs" can be written to from anywhere in the subtree
319 to migrate all threads of the matching process to the cgroup.
321 Only threaded controllers can be enabled in a threaded subtree. When
322 a threaded controller is enabled inside a threaded subtree, it only
323 accounts for and controls resource consumptions associated with the
324 threads in the cgroup and its descendants. All consumptions which
325 aren't tied to a specific thread belong to the threaded domain cgroup.
327 Because a threaded subtree is exempt from no internal process
328 constraint, a threaded controller must be able to handle competition
329 between threads in a non-leaf cgroup and its child cgroups. Each
330 threaded controller defines how such competitions are handled.
333 [Un]populated Notification
334 --------------------------
336 Each non-root cgroup has a "cgroup.events" file which contains
337 "populated" field indicating whether the cgroup's sub-hierarchy has
338 live processes in it. Its value is 0 if there is no live process in
339 the cgroup and its descendants; otherwise, 1. poll and [id]notify
340 events are triggered when the value changes. This can be used, for
341 example, to start a clean-up operation after all processes of a given
342 sub-hierarchy have exited. The populated state updates and
343 notifications are recursive. Consider the following sub-hierarchy
344 where the numbers in the parentheses represent the numbers of processes
350 A, B and C's "populated" fields would be 1 while D's 0. After the one
351 process in C exits, B and C's "populated" fields would flip to "0" and
352 file modified events will be generated on the "cgroup.events" files of
356 Controlling Controllers
357 -----------------------
359 Enabling and Disabling
360 ~~~~~~~~~~~~~~~~~~~~~~
362 Each cgroup has a "cgroup.controllers" file which lists all
363 controllers available for the cgroup to enable::
365 # cat cgroup.controllers
368 No controller is enabled by default. Controllers can be enabled and
369 disabled by writing to the "cgroup.subtree_control" file::
371 # echo "+cpu +memory -io" > cgroup.subtree_control
373 Only controllers which are listed in "cgroup.controllers" can be
374 enabled. When multiple operations are specified as above, either they
375 all succeed or fail. If multiple operations on the same controller
376 are specified, the last one is effective.
378 Enabling a controller in a cgroup indicates that the distribution of
379 the target resource across its immediate children will be controlled.
380 Consider the following sub-hierarchy. The enabled controllers are
381 listed in parentheses::
383 A(cpu,memory) - B(memory) - C()
386 As A has "cpu" and "memory" enabled, A will control the distribution
387 of CPU cycles and memory to its children, in this case, B. As B has
388 "memory" enabled but not "CPU", C and D will compete freely on CPU
389 cycles but their division of memory available to B will be controlled.
391 As a controller regulates the distribution of the target resource to
392 the cgroup's children, enabling it creates the controller's interface
393 files in the child cgroups. In the above example, enabling "cpu" on B
394 would create the "cpu." prefixed controller interface files in C and
395 D. Likewise, disabling "memory" from B would remove the "memory."
396 prefixed controller interface files from C and D. This means that the
397 controller interface files - anything which doesn't start with
398 "cgroup." are owned by the parent rather than the cgroup itself.
404 Resources are distributed top-down and a cgroup can further distribute
405 a resource only if the resource has been distributed to it from the
406 parent. This means that all non-root "cgroup.subtree_control" files
407 can only contain controllers which are enabled in the parent's
408 "cgroup.subtree_control" file. A controller can be enabled only if
409 the parent has the controller enabled and a controller can't be
410 disabled if one or more children have it enabled.
413 No Internal Process Constraint
414 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
416 Non-root cgroups can distribute domain resources to their children
417 only when they don't have any processes of their own. In other words,
418 only domain cgroups which don't contain any processes can have domain
419 controllers enabled in their "cgroup.subtree_control" files.
421 This guarantees that, when a domain controller is looking at the part
422 of the hierarchy which has it enabled, processes are always only on
423 the leaves. This rules out situations where child cgroups compete
424 against internal processes of the parent.
426 The root cgroup is exempt from this restriction. Root contains
427 processes and anonymous resource consumption which can't be associated
428 with any other cgroups and requires special treatment from most
429 controllers. How resource consumption in the root cgroup is governed
430 is up to each controller (for more information on this topic please
431 refer to the Non-normative information section in the Controllers
434 Note that the restriction doesn't get in the way if there is no
435 enabled controller in the cgroup's "cgroup.subtree_control". This is
436 important as otherwise it wouldn't be possible to create children of a
437 populated cgroup. To control resource distribution of a cgroup, the
438 cgroup must create children and transfer all its processes to the
439 children before enabling controllers in its "cgroup.subtree_control"
449 A cgroup can be delegated in two ways. First, to a less privileged
450 user by granting write access of the directory and its "cgroup.procs",
451 "cgroup.threads" and "cgroup.subtree_control" files to the user.
452 Second, if the "nsdelegate" mount option is set, automatically to a
453 cgroup namespace on namespace creation.
455 Because the resource control interface files in a given directory
456 control the distribution of the parent's resources, the delegatee
457 shouldn't be allowed to write to them. For the first method, this is
458 achieved by not granting access to these files. For the second, the
459 kernel rejects writes to all files other than "cgroup.procs" and
460 "cgroup.subtree_control" on a namespace root from inside the
463 The end results are equivalent for both delegation types. Once
464 delegated, the user can build sub-hierarchy under the directory,
465 organize processes inside it as it sees fit and further distribute the
466 resources it received from the parent. The limits and other settings
467 of all resource controllers are hierarchical and regardless of what
468 happens in the delegated sub-hierarchy, nothing can escape the
469 resource restrictions imposed by the parent.
471 Currently, cgroup doesn't impose any restrictions on the number of
472 cgroups in or nesting depth of a delegated sub-hierarchy; however,
473 this may be limited explicitly in the future.
476 Delegation Containment
477 ~~~~~~~~~~~~~~~~~~~~~~
479 A delegated sub-hierarchy is contained in the sense that processes
480 can't be moved into or out of the sub-hierarchy by the delegatee.
482 For delegations to a less privileged user, this is achieved by
483 requiring the following conditions for a process with a non-root euid
484 to migrate a target process into a cgroup by writing its PID to the
487 - The writer must have write access to the "cgroup.procs" file.
489 - The writer must have write access to the "cgroup.procs" file of the
490 common ancestor of the source and destination cgroups.
492 The above two constraints ensure that while a delegatee may migrate
493 processes around freely in the delegated sub-hierarchy it can't pull
494 in from or push out to outside the sub-hierarchy.
496 For an example, let's assume cgroups C0 and C1 have been delegated to
497 user U0 who created C00, C01 under C0 and C10 under C1 as follows and
498 all processes under C0 and C1 belong to U0::
500 ~~~~~~~~~~~~~ - C0 - C00
503 ~~~~~~~~~~~~~ - C1 - C10
505 Let's also say U0 wants to write the PID of a process which is
506 currently in C10 into "C00/cgroup.procs". U0 has write access to the
507 file; however, the common ancestor of the source cgroup C10 and the
508 destination cgroup C00 is above the points of delegation and U0 would
509 not have write access to its "cgroup.procs" files and thus the write
510 will be denied with -EACCES.
512 For delegations to namespaces, containment is achieved by requiring
513 that both the source and destination cgroups are reachable from the
514 namespace of the process which is attempting the migration. If either
515 is not reachable, the migration is rejected with -ENOENT.
521 Organize Once and Control
522 ~~~~~~~~~~~~~~~~~~~~~~~~~
524 Migrating a process across cgroups is a relatively expensive operation
525 and stateful resources such as memory are not moved together with the
526 process. This is an explicit design decision as there often exist
527 inherent trade-offs between migration and various hot paths in terms
528 of synchronization cost.
530 As such, migrating processes across cgroups frequently as a means to
531 apply different resource restrictions is discouraged. A workload
532 should be assigned to a cgroup according to the system's logical and
533 resource structure once on start-up. Dynamic adjustments to resource
534 distribution can be made by changing controller configuration through
538 Avoid Name Collisions
539 ~~~~~~~~~~~~~~~~~~~~~
541 Interface files for a cgroup and its children cgroups occupy the same
542 directory and it is possible to create children cgroups which collide
543 with interface files.
545 All cgroup core interface files are prefixed with "cgroup." and each
546 controller's interface files are prefixed with the controller name and
547 a dot. A controller's name is composed of lower case alphabets and
548 '_'s but never begins with an '_' so it can be used as the prefix
549 character for collision avoidance. Also, interface file names won't
550 start or end with terms which are often used in categorizing workloads
551 such as job, service, slice, unit or workload.
553 cgroup doesn't do anything to prevent name collisions and it's the
554 user's responsibility to avoid them.
557 Resource Distribution Models
558 ============================
560 cgroup controllers implement several resource distribution schemes
561 depending on the resource type and expected use cases. This section
562 describes major schemes in use along with their expected behaviors.
568 A parent's resource is distributed by adding up the weights of all
569 active children and giving each the fraction matching the ratio of its
570 weight against the sum. As only children which can make use of the
571 resource at the moment participate in the distribution, this is
572 work-conserving. Due to the dynamic nature, this model is usually
573 used for stateless resources.
575 All weights are in the range [1, 10000] with the default at 100. This
576 allows symmetric multiplicative biases in both directions at fine
577 enough granularity while staying in the intuitive range.
579 As long as the weight is in range, all configuration combinations are
580 valid and there is no reason to reject configuration changes or
583 "cpu.weight" proportionally distributes CPU cycles to active children
584 and is an example of this type.
590 A child can only consume upto the configured amount of the resource.
591 Limits can be over-committed - the sum of the limits of children can
592 exceed the amount of resource available to the parent.
594 Limits are in the range [0, max] and defaults to "max", which is noop.
596 As limits can be over-committed, all configuration combinations are
597 valid and there is no reason to reject configuration changes or
600 "io.max" limits the maximum BPS and/or IOPS that a cgroup can consume
601 on an IO device and is an example of this type.
607 A cgroup is protected to be allocated upto the configured amount of
608 the resource if the usages of all its ancestors are under their
609 protected levels. Protections can be hard guarantees or best effort
610 soft boundaries. Protections can also be over-committed in which case
611 only upto the amount available to the parent is protected among
614 Protections are in the range [0, max] and defaults to 0, which is
617 As protections can be over-committed, all configuration combinations
618 are valid and there is no reason to reject configuration changes or
621 "memory.low" implements best-effort memory protection and is an
622 example of this type.
628 A cgroup is exclusively allocated a certain amount of a finite
629 resource. Allocations can't be over-committed - the sum of the
630 allocations of children can not exceed the amount of resource
631 available to the parent.
633 Allocations are in the range [0, max] and defaults to 0, which is no
636 As allocations can't be over-committed, some configuration
637 combinations are invalid and should be rejected. Also, if the
638 resource is mandatory for execution of processes, process migrations
641 "cpu.rt.max" hard-allocates realtime slices and is an example of this
651 All interface files should be in one of the following formats whenever
654 New-line separated values
655 (when only one value can be written at once)
661 Space separated values
662 (when read-only or multiple values can be written at once)
674 KEY0 SUB_KEY0=VAL00 SUB_KEY1=VAL01...
675 KEY1 SUB_KEY0=VAL10 SUB_KEY1=VAL11...
678 For a writable file, the format for writing should generally match
679 reading; however, controllers may allow omitting later fields or
680 implement restricted shortcuts for most common use cases.
682 For both flat and nested keyed files, only the values for a single key
683 can be written at a time. For nested keyed files, the sub key pairs
684 may be specified in any order and not all pairs have to be specified.
690 - Settings for a single feature should be contained in a single file.
692 - The root cgroup should be exempt from resource control and thus
693 shouldn't have resource control interface files. Also,
694 informational files on the root cgroup which end up showing global
695 information available elsewhere shouldn't exist.
697 - If a controller implements weight based resource distribution, its
698 interface file should be named "weight" and have the range [1,
699 10000] with 100 as the default. The values are chosen to allow
700 enough and symmetric bias in both directions while keeping it
701 intuitive (the default is 100%).
703 - If a controller implements an absolute resource guarantee and/or
704 limit, the interface files should be named "min" and "max"
705 respectively. If a controller implements best effort resource
706 guarantee and/or limit, the interface files should be named "low"
707 and "high" respectively.
709 In the above four control files, the special token "max" should be
710 used to represent upward infinity for both reading and writing.
712 - If a setting has a configurable default value and keyed specific
713 overrides, the default entry should be keyed with "default" and
714 appear as the first entry in the file.
716 The default value can be updated by writing either "default $VAL" or
719 When writing to update a specific override, "default" can be used as
720 the value to indicate removal of the override. Override entries
721 with "default" as the value must not appear when read.
723 For example, a setting which is keyed by major:minor device numbers
724 with integer values may look like the following::
726 # cat cgroup-example-interface-file
730 The default value can be updated by::
732 # echo 125 > cgroup-example-interface-file
736 # echo "default 125" > cgroup-example-interface-file
738 An override can be set by::
740 # echo "8:16 170" > cgroup-example-interface-file
744 # echo "8:0 default" > cgroup-example-interface-file
745 # cat cgroup-example-interface-file
749 - For events which are not very high frequency, an interface file
750 "events" should be created which lists event key value pairs.
751 Whenever a notifiable event happens, file modified event should be
752 generated on the file.
758 All cgroup core files are prefixed with "cgroup."
762 A read-write single value file which exists on non-root
765 When read, it indicates the current type of the cgroup, which
766 can be one of the following values.
768 - "domain" : A normal valid domain cgroup.
770 - "domain threaded" : A threaded domain cgroup which is
771 serving as the root of a threaded subtree.
773 - "domain invalid" : A cgroup which is in an invalid state.
774 It can't be populated or have controllers enabled. It may
775 be allowed to become a threaded cgroup.
777 - "threaded" : A threaded cgroup which is a member of a
780 A cgroup can be turned into a threaded cgroup by writing
781 "threaded" to this file.
784 A read-write new-line separated values file which exists on
787 When read, it lists the PIDs of all processes which belong to
788 the cgroup one-per-line. The PIDs are not ordered and the
789 same PID may show up more than once if the process got moved
790 to another cgroup and then back or the PID got recycled while
793 A PID can be written to migrate the process associated with
794 the PID to the cgroup. The writer should match all of the
795 following conditions.
797 - It must have write access to the "cgroup.procs" file.
799 - It must have write access to the "cgroup.procs" file of the
800 common ancestor of the source and destination cgroups.
802 When delegating a sub-hierarchy, write access to this file
803 should be granted along with the containing directory.
805 In a threaded cgroup, reading this file fails with EOPNOTSUPP
806 as all the processes belong to the thread root. Writing is
807 supported and moves every thread of the process to the cgroup.
810 A read-write new-line separated values file which exists on
813 When read, it lists the TIDs of all threads which belong to
814 the cgroup one-per-line. The TIDs are not ordered and the
815 same TID may show up more than once if the thread got moved to
816 another cgroup and then back or the TID got recycled while
819 A TID can be written to migrate the thread associated with the
820 TID to the cgroup. The writer should match all of the
821 following conditions.
823 - It must have write access to the "cgroup.threads" file.
825 - The cgroup that the thread is currently in must be in the
826 same resource domain as the destination cgroup.
828 - It must have write access to the "cgroup.procs" file of the
829 common ancestor of the source and destination cgroups.
831 When delegating a sub-hierarchy, write access to this file
832 should be granted along with the containing directory.
835 A read-only space separated values file which exists on all
838 It shows space separated list of all controllers available to
839 the cgroup. The controllers are not ordered.
841 cgroup.subtree_control
842 A read-write space separated values file which exists on all
843 cgroups. Starts out empty.
845 When read, it shows space separated list of the controllers
846 which are enabled to control resource distribution from the
847 cgroup to its children.
849 Space separated list of controllers prefixed with '+' or '-'
850 can be written to enable or disable controllers. A controller
851 name prefixed with '+' enables the controller and '-'
852 disables. If a controller appears more than once on the list,
853 the last one is effective. When multiple enable and disable
854 operations are specified, either all succeed or all fail.
857 A read-only flat-keyed file which exists on non-root cgroups.
858 The following entries are defined. Unless specified
859 otherwise, a value change in this file generates a file
863 1 if the cgroup or its descendants contains any live
864 processes; otherwise, 0.
866 cgroup.max.descendants
867 A read-write single value files. The default is "max".
869 Maximum allowed number of descent cgroups.
870 If the actual number of descendants is equal or larger,
871 an attempt to create a new cgroup in the hierarchy will fail.
874 A read-write single value files. The default is "max".
876 Maximum allowed descent depth below the current cgroup.
877 If the actual descent depth is equal or larger,
878 an attempt to create a new child cgroup will fail.
881 A read-only flat-keyed file with the following entries:
884 Total number of visible descendant cgroups.
887 Total number of dying descendant cgroups. A cgroup becomes
888 dying after being deleted by a user. The cgroup will remain
889 in dying state for some time undefined time (which can depend
890 on system load) before being completely destroyed.
892 A process can't enter a dying cgroup under any circumstances,
893 a dying cgroup can't revive.
895 A dying cgroup can consume system resources not exceeding
896 limits, which were active at the moment of cgroup deletion.
905 The "cpu" controllers regulates distribution of CPU cycles. This
906 controller implements weight and absolute bandwidth limit models for
907 normal scheduling policy and absolute bandwidth allocation model for
908 realtime scheduling policy.
910 WARNING: cgroup2 doesn't yet support control of realtime processes and
911 the cpu controller can only be enabled when all RT processes are in
912 the root cgroup. Be aware that system management software may already
913 have placed RT processes into nonroot cgroups during the system boot
914 process, and these processes may need to be moved to the root cgroup
915 before the cpu controller can be enabled.
921 All time durations are in microseconds.
924 A read-only flat-keyed file which exists on non-root cgroups.
925 This file exists whether the controller is enabled or not.
927 It always reports the following three stats:
933 and the following three when the controller is enabled:
940 A read-write single value file which exists on non-root
941 cgroups. The default is "100".
943 The weight in the range [1, 10000].
946 A read-write single value file which exists on non-root
947 cgroups. The default is "0".
949 The nice value is in the range [-20, 19].
951 This interface file is an alternative interface for
952 "cpu.weight" and allows reading and setting weight using the
953 same values used by nice(2). Because the range is smaller and
954 granularity is coarser for the nice values, the read value is
955 the closest approximation of the current weight.
958 A read-write two value file which exists on non-root cgroups.
959 The default is "max 100000".
961 The maximum bandwidth limit. It's in the following format::
965 which indicates that the group may consume upto $MAX in each
966 $PERIOD duration. "max" for $MAX indicates no limit. If only
967 one number is written, $MAX is updated.
970 A read-only nested-key file which exists on non-root cgroups.
972 Shows pressure stall information for CPU. See
973 Documentation/accounting/psi.txt for details.
979 The "memory" controller regulates distribution of memory. Memory is
980 stateful and implements both limit and protection models. Due to the
981 intertwining between memory usage and reclaim pressure and the
982 stateful nature of memory, the distribution model is relatively
985 While not completely water-tight, all major memory usages by a given
986 cgroup are tracked so that the total memory consumption can be
987 accounted and controlled to a reasonable extent. Currently, the
988 following types of memory usages are tracked.
990 - Userland memory - page cache and anonymous memory.
992 - Kernel data structures such as dentries and inodes.
994 - TCP socket buffers.
996 The above list may expand in the future for better coverage.
999 Memory Interface Files
1000 ~~~~~~~~~~~~~~~~~~~~~~
1002 All memory amounts are in bytes. If a value which is not aligned to
1003 PAGE_SIZE is written, the value may be rounded up to the closest
1004 PAGE_SIZE multiple when read back.
1007 A read-only single value file which exists on non-root
1010 The total amount of memory currently being used by the cgroup
1011 and its descendants.
1014 A read-write single value file which exists on non-root
1015 cgroups. The default is "0".
1017 Hard memory protection. If the memory usage of a cgroup
1018 is within its effective min boundary, the cgroup's memory
1019 won't be reclaimed under any conditions. If there is no
1020 unprotected reclaimable memory available, OOM killer
1023 Effective min boundary is limited by memory.min values of
1024 all ancestor cgroups. If there is memory.min overcommitment
1025 (child cgroup or cgroups are requiring more protected memory
1026 than parent will allow), then each child cgroup will get
1027 the part of parent's protection proportional to its
1028 actual memory usage below memory.min.
1030 Putting more memory than generally available under this
1031 protection is discouraged and may lead to constant OOMs.
1033 If a memory cgroup is not populated with processes,
1034 its memory.min is ignored.
1037 A read-write single value file which exists on non-root
1038 cgroups. The default is "0".
1040 Best-effort memory protection. If the memory usage of a
1041 cgroup is within its effective low boundary, the cgroup's
1042 memory won't be reclaimed unless memory can be reclaimed
1043 from unprotected cgroups.
1045 Effective low boundary is limited by memory.low values of
1046 all ancestor cgroups. If there is memory.low overcommitment
1047 (child cgroup or cgroups are requiring more protected memory
1048 than parent will allow), then each child cgroup will get
1049 the part of parent's protection proportional to its
1050 actual memory usage below memory.low.
1052 Putting more memory than generally available under this
1053 protection is discouraged.
1056 A read-write single value file which exists on non-root
1057 cgroups. The default is "max".
1059 Memory usage throttle limit. This is the main mechanism to
1060 control memory usage of a cgroup. If a cgroup's usage goes
1061 over the high boundary, the processes of the cgroup are
1062 throttled and put under heavy reclaim pressure.
1064 Going over the high limit never invokes the OOM killer and
1065 under extreme conditions the limit may be breached.
1068 A read-write single value file which exists on non-root
1069 cgroups. The default is "max".
1071 Memory usage hard limit. This is the final protection
1072 mechanism. If a cgroup's memory usage reaches this limit and
1073 can't be reduced, the OOM killer is invoked in the cgroup.
1074 Under certain circumstances, the usage may go over the limit
1077 This is the ultimate protection mechanism. As long as the
1078 high limit is used and monitored properly, this limit's
1079 utility is limited to providing the final safety net.
1082 A read-write single value file which exists on non-root
1083 cgroups. The default value is "0".
1085 Determines whether the cgroup should be treated as
1086 an indivisible workload by the OOM killer. If set,
1087 all tasks belonging to the cgroup or to its descendants
1088 (if the memory cgroup is not a leaf cgroup) are killed
1089 together or not at all. This can be used to avoid
1090 partial kills to guarantee workload integrity.
1092 Tasks with the OOM protection (oom_score_adj set to -1000)
1093 are treated as an exception and are never killed.
1095 If the OOM killer is invoked in a cgroup, it's not going
1096 to kill any tasks outside of this cgroup, regardless
1097 memory.oom.group values of ancestor cgroups.
1100 A read-only flat-keyed file which exists on non-root cgroups.
1101 The following entries are defined. Unless specified
1102 otherwise, a value change in this file generates a file
1106 The number of times the cgroup is reclaimed due to
1107 high memory pressure even though its usage is under
1108 the low boundary. This usually indicates that the low
1109 boundary is over-committed.
1112 The number of times processes of the cgroup are
1113 throttled and routed to perform direct memory reclaim
1114 because the high memory boundary was exceeded. For a
1115 cgroup whose memory usage is capped by the high limit
1116 rather than global memory pressure, this event's
1117 occurrences are expected.
1120 The number of times the cgroup's memory usage was
1121 about to go over the max boundary. If direct reclaim
1122 fails to bring it down, the cgroup goes to OOM state.
1125 The number of time the cgroup's memory usage was
1126 reached the limit and allocation was about to fail.
1128 Depending on context result could be invocation of OOM
1129 killer and retrying allocation or failing allocation.
1131 Failed allocation in its turn could be returned into
1132 userspace as -ENOMEM or silently ignored in cases like
1133 disk readahead. For now OOM in memory cgroup kills
1134 tasks iff shortage has happened inside page fault.
1136 This event is not raised if the OOM killer is not
1137 considered as an option, e.g. for failed high-order
1141 The number of processes belonging to this cgroup
1142 killed by any kind of OOM killer.
1145 A read-only flat-keyed file which exists on non-root cgroups.
1147 This breaks down the cgroup's memory footprint into different
1148 types of memory, type-specific details, and other information
1149 on the state and past events of the memory management system.
1151 All memory amounts are in bytes.
1153 The entries are ordered to be human readable, and new entries
1154 can show up in the middle. Don't rely on items remaining in a
1155 fixed position; use the keys to look up specific values!
1158 Amount of memory used in anonymous mappings such as
1159 brk(), sbrk(), and mmap(MAP_ANONYMOUS)
1162 Amount of memory used to cache filesystem data,
1163 including tmpfs and shared memory.
1166 Amount of memory allocated to kernel stacks.
1169 Amount of memory used for storing in-kernel data
1173 Amount of memory used in network transmission buffers
1176 Amount of cached filesystem data that is swap-backed,
1177 such as tmpfs, shm segments, shared anonymous mmap()s
1180 Amount of cached filesystem data mapped with mmap()
1183 Amount of cached filesystem data that was modified but
1184 not yet written back to disk
1187 Amount of cached filesystem data that was modified and
1188 is currently being written back to disk
1190 inactive_anon, active_anon, inactive_file, active_file, unevictable
1191 Amount of memory, swap-backed and filesystem-backed,
1192 on the internal memory management lists used by the
1193 page reclaim algorithm
1196 Part of "slab" that might be reclaimed, such as
1197 dentries and inodes.
1200 Part of "slab" that cannot be reclaimed on memory
1204 Total number of page faults incurred
1207 Number of major page faults incurred
1211 Number of refaults of previously evicted pages
1215 Number of refaulted pages that were immediately activated
1217 workingset_nodereclaim
1219 Number of times a shadow node has been reclaimed
1223 Amount of scanned pages (in an active LRU list)
1227 Amount of scanned pages (in an inactive LRU list)
1231 Amount of reclaimed pages
1235 Amount of pages moved to the active LRU list
1239 Amount of pages moved to the inactive LRU lis
1243 Amount of pages postponed to be freed under memory pressure
1247 Amount of reclaimed lazyfree pages
1250 A read-only single value file which exists on non-root
1253 The total amount of swap currently being used by the cgroup
1254 and its descendants.
1257 A read-write single value file which exists on non-root
1258 cgroups. The default is "max".
1260 Swap usage hard limit. If a cgroup's swap usage reaches this
1261 limit, anonymous memory of the cgroup will not be swapped out.
1264 A read-only flat-keyed file which exists on non-root cgroups.
1265 The following entries are defined. Unless specified
1266 otherwise, a value change in this file generates a file
1270 The number of times the cgroup's swap usage was about
1271 to go over the max boundary and swap allocation
1275 The number of times swap allocation failed either
1276 because of running out of swap system-wide or max
1279 When reduced under the current usage, the existing swap
1280 entries are reclaimed gradually and the swap usage may stay
1281 higher than the limit for an extended period of time. This
1282 reduces the impact on the workload and memory management.
1285 A read-only nested-key file which exists on non-root cgroups.
1287 Shows pressure stall information for memory. See
1288 Documentation/accounting/psi.txt for details.
1294 "memory.high" is the main mechanism to control memory usage.
1295 Over-committing on high limit (sum of high limits > available memory)
1296 and letting global memory pressure to distribute memory according to
1297 usage is a viable strategy.
1299 Because breach of the high limit doesn't trigger the OOM killer but
1300 throttles the offending cgroup, a management agent has ample
1301 opportunities to monitor and take appropriate actions such as granting
1302 more memory or terminating the workload.
1304 Determining whether a cgroup has enough memory is not trivial as
1305 memory usage doesn't indicate whether the workload can benefit from
1306 more memory. For example, a workload which writes data received from
1307 network to a file can use all available memory but can also operate as
1308 performant with a small amount of memory. A measure of memory
1309 pressure - how much the workload is being impacted due to lack of
1310 memory - is necessary to determine whether a workload needs more
1311 memory; unfortunately, memory pressure monitoring mechanism isn't
1318 A memory area is charged to the cgroup which instantiated it and stays
1319 charged to the cgroup until the area is released. Migrating a process
1320 to a different cgroup doesn't move the memory usages that it
1321 instantiated while in the previous cgroup to the new cgroup.
1323 A memory area may be used by processes belonging to different cgroups.
1324 To which cgroup the area will be charged is in-deterministic; however,
1325 over time, the memory area is likely to end up in a cgroup which has
1326 enough memory allowance to avoid high reclaim pressure.
1328 If a cgroup sweeps a considerable amount of memory which is expected
1329 to be accessed repeatedly by other cgroups, it may make sense to use
1330 POSIX_FADV_DONTNEED to relinquish the ownership of memory areas
1331 belonging to the affected files to ensure correct memory ownership.
1337 The "io" controller regulates the distribution of IO resources. This
1338 controller implements both weight based and absolute bandwidth or IOPS
1339 limit distribution; however, weight based distribution is available
1340 only if cfq-iosched is in use and neither scheme is available for
1348 A read-only nested-keyed file which exists on non-root
1351 Lines are keyed by $MAJ:$MIN device numbers and not ordered.
1352 The following nested keys are defined.
1354 ====== =====================
1356 wbytes Bytes written
1357 rios Number of read IOs
1358 wios Number of write IOs
1359 dbytes Bytes discarded
1360 dios Number of discard IOs
1361 ====== =====================
1363 An example read output follows:
1365 8:16 rbytes=1459200 wbytes=314773504 rios=192 wios=353 dbytes=0 dios=0
1366 8:0 rbytes=90430464 wbytes=299008000 rios=8950 wios=1252 dbytes=50331648 dios=3021
1369 A read-write flat-keyed file which exists on non-root cgroups.
1370 The default is "default 100".
1372 The first line is the default weight applied to devices
1373 without specific override. The rest are overrides keyed by
1374 $MAJ:$MIN device numbers and not ordered. The weights are in
1375 the range [1, 10000] and specifies the relative amount IO time
1376 the cgroup can use in relation to its siblings.
1378 The default weight can be updated by writing either "default
1379 $WEIGHT" or simply "$WEIGHT". Overrides can be set by writing
1380 "$MAJ:$MIN $WEIGHT" and unset by writing "$MAJ:$MIN default".
1382 An example read output follows::
1389 A read-write nested-keyed file which exists on non-root
1392 BPS and IOPS based IO limit. Lines are keyed by $MAJ:$MIN
1393 device numbers and not ordered. The following nested keys are
1396 ===== ==================================
1397 rbps Max read bytes per second
1398 wbps Max write bytes per second
1399 riops Max read IO operations per second
1400 wiops Max write IO operations per second
1401 ===== ==================================
1403 When writing, any number of nested key-value pairs can be
1404 specified in any order. "max" can be specified as the value
1405 to remove a specific limit. If the same key is specified
1406 multiple times, the outcome is undefined.
1408 BPS and IOPS are measured in each IO direction and IOs are
1409 delayed if limit is reached. Temporary bursts are allowed.
1411 Setting read limit at 2M BPS and write at 120 IOPS for 8:16::
1413 echo "8:16 rbps=2097152 wiops=120" > io.max
1415 Reading returns the following::
1417 8:16 rbps=2097152 wbps=max riops=max wiops=120
1419 Write IOPS limit can be removed by writing the following::
1421 echo "8:16 wiops=max" > io.max
1423 Reading now returns the following::
1425 8:16 rbps=2097152 wbps=max riops=max wiops=max
1428 A read-only nested-key file which exists on non-root cgroups.
1430 Shows pressure stall information for IO. See
1431 Documentation/accounting/psi.txt for details.
1437 Page cache is dirtied through buffered writes and shared mmaps and
1438 written asynchronously to the backing filesystem by the writeback
1439 mechanism. Writeback sits between the memory and IO domains and
1440 regulates the proportion of dirty memory by balancing dirtying and
1443 The io controller, in conjunction with the memory controller,
1444 implements control of page cache writeback IOs. The memory controller
1445 defines the memory domain that dirty memory ratio is calculated and
1446 maintained for and the io controller defines the io domain which
1447 writes out dirty pages for the memory domain. Both system-wide and
1448 per-cgroup dirty memory states are examined and the more restrictive
1449 of the two is enforced.
1451 cgroup writeback requires explicit support from the underlying
1452 filesystem. Currently, cgroup writeback is implemented on ext2, ext4
1453 and btrfs. On other filesystems, all writeback IOs are attributed to
1456 There are inherent differences in memory and writeback management
1457 which affects how cgroup ownership is tracked. Memory is tracked per
1458 page while writeback per inode. For the purpose of writeback, an
1459 inode is assigned to a cgroup and all IO requests to write dirty pages
1460 from the inode are attributed to that cgroup.
1462 As cgroup ownership for memory is tracked per page, there can be pages
1463 which are associated with different cgroups than the one the inode is
1464 associated with. These are called foreign pages. The writeback
1465 constantly keeps track of foreign pages and, if a particular foreign
1466 cgroup becomes the majority over a certain period of time, switches
1467 the ownership of the inode to that cgroup.
1469 While this model is enough for most use cases where a given inode is
1470 mostly dirtied by a single cgroup even when the main writing cgroup
1471 changes over time, use cases where multiple cgroups write to a single
1472 inode simultaneously are not supported well. In such circumstances, a
1473 significant portion of IOs are likely to be attributed incorrectly.
1474 As memory controller assigns page ownership on the first use and
1475 doesn't update it until the page is released, even if writeback
1476 strictly follows page ownership, multiple cgroups dirtying overlapping
1477 areas wouldn't work as expected. It's recommended to avoid such usage
1480 The sysctl knobs which affect writeback behavior are applied to cgroup
1481 writeback as follows.
1483 vm.dirty_background_ratio, vm.dirty_ratio
1484 These ratios apply the same to cgroup writeback with the
1485 amount of available memory capped by limits imposed by the
1486 memory controller and system-wide clean memory.
1488 vm.dirty_background_bytes, vm.dirty_bytes
1489 For cgroup writeback, this is calculated into ratio against
1490 total available memory and applied the same way as
1491 vm.dirty[_background]_ratio.
1497 This is a cgroup v2 controller for IO workload protection. You provide a group
1498 with a latency target, and if the average latency exceeds that target the
1499 controller will throttle any peers that have a lower latency target than the
1502 The limits are only applied at the peer level in the hierarchy. This means that
1503 in the diagram below, only groups A, B, and C will influence each other, and
1504 groups D and F will influence each other. Group G will influence nobody.
1513 So the ideal way to configure this is to set io.latency in groups A, B, and C.
1514 Generally you do not want to set a value lower than the latency your device
1515 supports. Experiment to find the value that works best for your workload.
1516 Start at higher than the expected latency for your device and watch the
1517 avg_lat value in io.stat for your workload group to get an idea of the
1518 latency you see during normal operation. Use the avg_lat value as a basis for
1519 your real setting, setting at 10-15% higher than the value in io.stat.
1521 How IO Latency Throttling Works
1522 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1524 io.latency is work conserving; so as long as everybody is meeting their latency
1525 target the controller doesn't do anything. Once a group starts missing its
1526 target it begins throttling any peer group that has a higher target than itself.
1527 This throttling takes 2 forms:
1529 - Queue depth throttling. This is the number of outstanding IO's a group is
1530 allowed to have. We will clamp down relatively quickly, starting at no limit
1531 and going all the way down to 1 IO at a time.
1533 - Artificial delay induction. There are certain types of IO that cannot be
1534 throttled without possibly adversely affecting higher priority groups. This
1535 includes swapping and metadata IO. These types of IO are allowed to occur
1536 normally, however they are "charged" to the originating group. If the
1537 originating group is being throttled you will see the use_delay and delay
1538 fields in io.stat increase. The delay value is how many microseconds that are
1539 being added to any process that runs in this group. Because this number can
1540 grow quite large if there is a lot of swapping or metadata IO occurring we
1541 limit the individual delay events to 1 second at a time.
1543 Once the victimized group starts meeting its latency target again it will start
1544 unthrottling any peer groups that were throttled previously. If the victimized
1545 group simply stops doing IO the global counter will unthrottle appropriately.
1547 IO Latency Interface Files
1548 ~~~~~~~~~~~~~~~~~~~~~~~~~~
1551 This takes a similar format as the other controllers.
1553 "MAJOR:MINOR target=<target time in microseconds"
1556 If the controller is enabled you will see extra stats in io.stat in
1557 addition to the normal ones.
1560 This is the current queue depth for the group.
1563 This is an exponential moving average with a decay rate of 1/exp
1564 bound by the sampling interval. The decay rate interval can be
1565 calculated by multiplying the win value in io.stat by the
1566 corresponding number of samples based on the win value.
1569 The sampling window size in milliseconds. This is the minimum
1570 duration of time between evaluation events. Windows only elapse
1571 with IO activity. Idle periods extend the most recent window.
1576 The process number controller is used to allow a cgroup to stop any
1577 new tasks from being fork()'d or clone()'d after a specified limit is
1580 The number of tasks in a cgroup can be exhausted in ways which other
1581 controllers cannot prevent, thus warranting its own controller. For
1582 example, a fork bomb is likely to exhaust the number of tasks before
1583 hitting memory restrictions.
1585 Note that PIDs used in this controller refer to TIDs, process IDs as
1593 A read-write single value file which exists on non-root
1594 cgroups. The default is "max".
1596 Hard limit of number of processes.
1599 A read-only single value file which exists on all cgroups.
1601 The number of processes currently in the cgroup and its
1604 Organisational operations are not blocked by cgroup policies, so it is
1605 possible to have pids.current > pids.max. This can be done by either
1606 setting the limit to be smaller than pids.current, or attaching enough
1607 processes to the cgroup such that pids.current is larger than
1608 pids.max. However, it is not possible to violate a cgroup PID policy
1609 through fork() or clone(). These will return -EAGAIN if the creation
1610 of a new process would cause a cgroup policy to be violated.
1616 Device controller manages access to device files. It includes both
1617 creation of new device files (using mknod), and access to the
1618 existing device files.
1620 Cgroup v2 device controller has no interface files and is implemented
1621 on top of cgroup BPF. To control access to device files, a user may
1622 create bpf programs of the BPF_CGROUP_DEVICE type and attach them
1623 to cgroups. On an attempt to access a device file, corresponding
1624 BPF programs will be executed, and depending on the return value
1625 the attempt will succeed or fail with -EPERM.
1627 A BPF_CGROUP_DEVICE program takes a pointer to the bpf_cgroup_dev_ctx
1628 structure, which describes the device access attempt: access type
1629 (mknod/read/write) and device (type, major and minor numbers).
1630 If the program returns 0, the attempt fails with -EPERM, otherwise
1633 An example of BPF_CGROUP_DEVICE program may be found in the kernel
1634 source tree in the tools/testing/selftests/bpf/dev_cgroup.c file.
1640 The "rdma" controller regulates the distribution and accounting of
1643 RDMA Interface Files
1644 ~~~~~~~~~~~~~~~~~~~~
1647 A readwrite nested-keyed file that exists for all the cgroups
1648 except root that describes current configured resource limit
1649 for a RDMA/IB device.
1651 Lines are keyed by device name and are not ordered.
1652 Each line contains space separated resource name and its configured
1653 limit that can be distributed.
1655 The following nested keys are defined.
1657 ========== =============================
1658 hca_handle Maximum number of HCA Handles
1659 hca_object Maximum number of HCA Objects
1660 ========== =============================
1662 An example for mlx4 and ocrdma device follows::
1664 mlx4_0 hca_handle=2 hca_object=2000
1665 ocrdma1 hca_handle=3 hca_object=max
1668 A read-only file that describes current resource usage.
1669 It exists for all the cgroup except root.
1671 An example for mlx4 and ocrdma device follows::
1673 mlx4_0 hca_handle=1 hca_object=20
1674 ocrdma1 hca_handle=1 hca_object=23
1683 perf_event controller, if not mounted on a legacy hierarchy, is
1684 automatically enabled on the v2 hierarchy so that perf events can
1685 always be filtered by cgroup v2 path. The controller can still be
1686 moved to a legacy hierarchy after v2 hierarchy is populated.
1689 Non-normative information
1690 -------------------------
1692 This section contains information that isn't considered to be a part of
1693 the stable kernel API and so is subject to change.
1696 CPU controller root cgroup process behaviour
1697 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1699 When distributing CPU cycles in the root cgroup each thread in this
1700 cgroup is treated as if it was hosted in a separate child cgroup of the
1701 root cgroup. This child cgroup weight is dependent on its thread nice
1704 For details of this mapping see sched_prio_to_weight array in
1705 kernel/sched/core.c file (values from this array should be scaled
1706 appropriately so the neutral - nice 0 - value is 100 instead of 1024).
1709 IO controller root cgroup process behaviour
1710 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1712 Root cgroup processes are hosted in an implicit leaf child node.
1713 When distributing IO resources this implicit child node is taken into
1714 account as if it was a normal child cgroup of the root cgroup with a
1715 weight value of 200.
1724 cgroup namespace provides a mechanism to virtualize the view of the
1725 "/proc/$PID/cgroup" file and cgroup mounts. The CLONE_NEWCGROUP clone
1726 flag can be used with clone(2) and unshare(2) to create a new cgroup
1727 namespace. The process running inside the cgroup namespace will have
1728 its "/proc/$PID/cgroup" output restricted to cgroupns root. The
1729 cgroupns root is the cgroup of the process at the time of creation of
1730 the cgroup namespace.
1732 Without cgroup namespace, the "/proc/$PID/cgroup" file shows the
1733 complete path of the cgroup of a process. In a container setup where
1734 a set of cgroups and namespaces are intended to isolate processes the
1735 "/proc/$PID/cgroup" file may leak potential system level information
1736 to the isolated processes. For Example::
1738 # cat /proc/self/cgroup
1739 0::/batchjobs/container_id1
1741 The path '/batchjobs/container_id1' can be considered as system-data
1742 and undesirable to expose to the isolated processes. cgroup namespace
1743 can be used to restrict visibility of this path. For example, before
1744 creating a cgroup namespace, one would see::
1746 # ls -l /proc/self/ns/cgroup
1747 lrwxrwxrwx 1 root root 0 2014-07-15 10:37 /proc/self/ns/cgroup -> cgroup:[4026531835]
1748 # cat /proc/self/cgroup
1749 0::/batchjobs/container_id1
1751 After unsharing a new namespace, the view changes::
1753 # ls -l /proc/self/ns/cgroup
1754 lrwxrwxrwx 1 root root 0 2014-07-15 10:35 /proc/self/ns/cgroup -> cgroup:[4026532183]
1755 # cat /proc/self/cgroup
1758 When some thread from a multi-threaded process unshares its cgroup
1759 namespace, the new cgroupns gets applied to the entire process (all
1760 the threads). This is natural for the v2 hierarchy; however, for the
1761 legacy hierarchies, this may be unexpected.
1763 A cgroup namespace is alive as long as there are processes inside or
1764 mounts pinning it. When the last usage goes away, the cgroup
1765 namespace is destroyed. The cgroupns root and the actual cgroups
1772 The 'cgroupns root' for a cgroup namespace is the cgroup in which the
1773 process calling unshare(2) is running. For example, if a process in
1774 /batchjobs/container_id1 cgroup calls unshare, cgroup
1775 /batchjobs/container_id1 becomes the cgroupns root. For the
1776 init_cgroup_ns, this is the real root ('/') cgroup.
1778 The cgroupns root cgroup does not change even if the namespace creator
1779 process later moves to a different cgroup::
1781 # ~/unshare -c # unshare cgroupns in some cgroup
1782 # cat /proc/self/cgroup
1785 # echo 0 > sub_cgrp_1/cgroup.procs
1786 # cat /proc/self/cgroup
1789 Each process gets its namespace-specific view of "/proc/$PID/cgroup"
1791 Processes running inside the cgroup namespace will be able to see
1792 cgroup paths (in /proc/self/cgroup) only inside their root cgroup.
1793 From within an unshared cgroupns::
1797 # echo 7353 > sub_cgrp_1/cgroup.procs
1798 # cat /proc/7353/cgroup
1801 From the initial cgroup namespace, the real cgroup path will be
1804 $ cat /proc/7353/cgroup
1805 0::/batchjobs/container_id1/sub_cgrp_1
1807 From a sibling cgroup namespace (that is, a namespace rooted at a
1808 different cgroup), the cgroup path relative to its own cgroup
1809 namespace root will be shown. For instance, if PID 7353's cgroup
1810 namespace root is at '/batchjobs/container_id2', then it will see::
1812 # cat /proc/7353/cgroup
1813 0::/../container_id2/sub_cgrp_1
1815 Note that the relative path always starts with '/' to indicate that
1816 its relative to the cgroup namespace root of the caller.
1819 Migration and setns(2)
1820 ----------------------
1822 Processes inside a cgroup namespace can move into and out of the
1823 namespace root if they have proper access to external cgroups. For
1824 example, from inside a namespace with cgroupns root at
1825 /batchjobs/container_id1, and assuming that the global hierarchy is
1826 still accessible inside cgroupns::
1828 # cat /proc/7353/cgroup
1830 # echo 7353 > batchjobs/container_id2/cgroup.procs
1831 # cat /proc/7353/cgroup
1832 0::/../container_id2
1834 Note that this kind of setup is not encouraged. A task inside cgroup
1835 namespace should only be exposed to its own cgroupns hierarchy.
1837 setns(2) to another cgroup namespace is allowed when:
1839 (a) the process has CAP_SYS_ADMIN against its current user namespace
1840 (b) the process has CAP_SYS_ADMIN against the target cgroup
1843 No implicit cgroup changes happen with attaching to another cgroup
1844 namespace. It is expected that the someone moves the attaching
1845 process under the target cgroup namespace root.
1848 Interaction with Other Namespaces
1849 ---------------------------------
1851 Namespace specific cgroup hierarchy can be mounted by a process
1852 running inside a non-init cgroup namespace::
1854 # mount -t cgroup2 none $MOUNT_POINT
1856 This will mount the unified cgroup hierarchy with cgroupns root as the
1857 filesystem root. The process needs CAP_SYS_ADMIN against its user and
1860 The virtualization of /proc/self/cgroup file combined with restricting
1861 the view of cgroup hierarchy by namespace-private cgroupfs mount
1862 provides a properly isolated cgroup view inside the container.
1865 Information on Kernel Programming
1866 =================================
1868 This section contains kernel programming information in the areas
1869 where interacting with cgroup is necessary. cgroup core and
1870 controllers are not covered.
1873 Filesystem Support for Writeback
1874 --------------------------------
1876 A filesystem can support cgroup writeback by updating
1877 address_space_operations->writepage[s]() to annotate bio's using the
1878 following two functions.
1880 wbc_init_bio(@wbc, @bio)
1881 Should be called for each bio carrying writeback data and
1882 associates the bio with the inode's owner cgroup. Can be
1883 called anytime between bio allocation and submission.
1885 wbc_account_io(@wbc, @page, @bytes)
1886 Should be called for each data segment being written out.
1887 While this function doesn't care exactly when it's called
1888 during the writeback session, it's the easiest and most
1889 natural to call it as data segments are added to a bio.
1891 With writeback bio's annotated, cgroup support can be enabled per
1892 super_block by setting SB_I_CGROUPWB in ->s_iflags. This allows for
1893 selective disabling of cgroup writeback support which is helpful when
1894 certain filesystem features, e.g. journaled data mode, are
1897 wbc_init_bio() binds the specified bio to its cgroup. Depending on
1898 the configuration, the bio may be executed at a lower priority and if
1899 the writeback session is holding shared resources, e.g. a journal
1900 entry, may lead to priority inversion. There is no one easy solution
1901 for the problem. Filesystems can try to work around specific problem
1902 cases by skipping wbc_init_bio() or using bio_associate_blkcg()
1906 Deprecated v1 Core Features
1907 ===========================
1909 - Multiple hierarchies including named ones are not supported.
1911 - All v1 mount options are not supported.
1913 - The "tasks" file is removed and "cgroup.procs" is not sorted.
1915 - "cgroup.clone_children" is removed.
1917 - /proc/cgroups is meaningless for v2. Use "cgroup.controllers" file
1918 at the root instead.
1921 Issues with v1 and Rationales for v2
1922 ====================================
1924 Multiple Hierarchies
1925 --------------------
1927 cgroup v1 allowed an arbitrary number of hierarchies and each
1928 hierarchy could host any number of controllers. While this seemed to
1929 provide a high level of flexibility, it wasn't useful in practice.
1931 For example, as there is only one instance of each controller, utility
1932 type controllers such as freezer which can be useful in all
1933 hierarchies could only be used in one. The issue is exacerbated by
1934 the fact that controllers couldn't be moved to another hierarchy once
1935 hierarchies were populated. Another issue was that all controllers
1936 bound to a hierarchy were forced to have exactly the same view of the
1937 hierarchy. It wasn't possible to vary the granularity depending on
1938 the specific controller.
1940 In practice, these issues heavily limited which controllers could be
1941 put on the same hierarchy and most configurations resorted to putting
1942 each controller on its own hierarchy. Only closely related ones, such
1943 as the cpu and cpuacct controllers, made sense to be put on the same
1944 hierarchy. This often meant that userland ended up managing multiple
1945 similar hierarchies repeating the same steps on each hierarchy
1946 whenever a hierarchy management operation was necessary.
1948 Furthermore, support for multiple hierarchies came at a steep cost.
1949 It greatly complicated cgroup core implementation but more importantly
1950 the support for multiple hierarchies restricted how cgroup could be
1951 used in general and what controllers was able to do.
1953 There was no limit on how many hierarchies there might be, which meant
1954 that a thread's cgroup membership couldn't be described in finite
1955 length. The key might contain any number of entries and was unlimited
1956 in length, which made it highly awkward to manipulate and led to
1957 addition of controllers which existed only to identify membership,
1958 which in turn exacerbated the original problem of proliferating number
1961 Also, as a controller couldn't have any expectation regarding the
1962 topologies of hierarchies other controllers might be on, each
1963 controller had to assume that all other controllers were attached to
1964 completely orthogonal hierarchies. This made it impossible, or at
1965 least very cumbersome, for controllers to cooperate with each other.
1967 In most use cases, putting controllers on hierarchies which are
1968 completely orthogonal to each other isn't necessary. What usually is
1969 called for is the ability to have differing levels of granularity
1970 depending on the specific controller. In other words, hierarchy may
1971 be collapsed from leaf towards root when viewed from specific
1972 controllers. For example, a given configuration might not care about
1973 how memory is distributed beyond a certain level while still wanting
1974 to control how CPU cycles are distributed.
1980 cgroup v1 allowed threads of a process to belong to different cgroups.
1981 This didn't make sense for some controllers and those controllers
1982 ended up implementing different ways to ignore such situations but
1983 much more importantly it blurred the line between API exposed to
1984 individual applications and system management interface.
1986 Generally, in-process knowledge is available only to the process
1987 itself; thus, unlike service-level organization of processes,
1988 categorizing threads of a process requires active participation from
1989 the application which owns the target process.
1991 cgroup v1 had an ambiguously defined delegation model which got abused
1992 in combination with thread granularity. cgroups were delegated to
1993 individual applications so that they can create and manage their own
1994 sub-hierarchies and control resource distributions along them. This
1995 effectively raised cgroup to the status of a syscall-like API exposed
1998 First of all, cgroup has a fundamentally inadequate interface to be
1999 exposed this way. For a process to access its own knobs, it has to
2000 extract the path on the target hierarchy from /proc/self/cgroup,
2001 construct the path by appending the name of the knob to the path, open
2002 and then read and/or write to it. This is not only extremely clunky
2003 and unusual but also inherently racy. There is no conventional way to
2004 define transaction across the required steps and nothing can guarantee
2005 that the process would actually be operating on its own sub-hierarchy.
2007 cgroup controllers implemented a number of knobs which would never be
2008 accepted as public APIs because they were just adding control knobs to
2009 system-management pseudo filesystem. cgroup ended up with interface
2010 knobs which were not properly abstracted or refined and directly
2011 revealed kernel internal details. These knobs got exposed to
2012 individual applications through the ill-defined delegation mechanism
2013 effectively abusing cgroup as a shortcut to implementing public APIs
2014 without going through the required scrutiny.
2016 This was painful for both userland and kernel. Userland ended up with
2017 misbehaving and poorly abstracted interfaces and kernel exposing and
2018 locked into constructs inadvertently.
2021 Competition Between Inner Nodes and Threads
2022 -------------------------------------------
2024 cgroup v1 allowed threads to be in any cgroups which created an
2025 interesting problem where threads belonging to a parent cgroup and its
2026 children cgroups competed for resources. This was nasty as two
2027 different types of entities competed and there was no obvious way to
2028 settle it. Different controllers did different things.
2030 The cpu controller considered threads and cgroups as equivalents and
2031 mapped nice levels to cgroup weights. This worked for some cases but
2032 fell flat when children wanted to be allocated specific ratios of CPU
2033 cycles and the number of internal threads fluctuated - the ratios
2034 constantly changed as the number of competing entities fluctuated.
2035 There also were other issues. The mapping from nice level to weight
2036 wasn't obvious or universal, and there were various other knobs which
2037 simply weren't available for threads.
2039 The io controller implicitly created a hidden leaf node for each
2040 cgroup to host the threads. The hidden leaf had its own copies of all
2041 the knobs with ``leaf_`` prefixed. While this allowed equivalent
2042 control over internal threads, it was with serious drawbacks. It
2043 always added an extra layer of nesting which wouldn't be necessary
2044 otherwise, made the interface messy and significantly complicated the
2047 The memory controller didn't have a way to control what happened
2048 between internal tasks and child cgroups and the behavior was not
2049 clearly defined. There were attempts to add ad-hoc behaviors and
2050 knobs to tailor the behavior to specific workloads which would have
2051 led to problems extremely difficult to resolve in the long term.
2053 Multiple controllers struggled with internal tasks and came up with
2054 different ways to deal with it; unfortunately, all the approaches were
2055 severely flawed and, furthermore, the widely different behaviors
2056 made cgroup as a whole highly inconsistent.
2058 This clearly is a problem which needs to be addressed from cgroup core
2062 Other Interface Issues
2063 ----------------------
2065 cgroup v1 grew without oversight and developed a large number of
2066 idiosyncrasies and inconsistencies. One issue on the cgroup core side
2067 was how an empty cgroup was notified - a userland helper binary was
2068 forked and executed for each event. The event delivery wasn't
2069 recursive or delegatable. The limitations of the mechanism also led
2070 to in-kernel event delivery filtering mechanism further complicating
2073 Controller interfaces were problematic too. An extreme example is
2074 controllers completely ignoring hierarchical organization and treating
2075 all cgroups as if they were all located directly under the root
2076 cgroup. Some controllers exposed a large amount of inconsistent
2077 implementation details to userland.
2079 There also was no consistency across controllers. When a new cgroup
2080 was created, some controllers defaulted to not imposing extra
2081 restrictions while others disallowed any resource usage until
2082 explicitly configured. Configuration knobs for the same type of
2083 control used widely differing naming schemes and formats. Statistics
2084 and information knobs were named arbitrarily and used different
2085 formats and units even in the same controller.
2087 cgroup v2 establishes common conventions where appropriate and updates
2088 controllers so that they expose minimal and consistent interfaces.
2091 Controller Issues and Remedies
2092 ------------------------------
2097 The original lower boundary, the soft limit, is defined as a limit
2098 that is per default unset. As a result, the set of cgroups that
2099 global reclaim prefers is opt-in, rather than opt-out. The costs for
2100 optimizing these mostly negative lookups are so high that the
2101 implementation, despite its enormous size, does not even provide the
2102 basic desirable behavior. First off, the soft limit has no
2103 hierarchical meaning. All configured groups are organized in a global
2104 rbtree and treated like equal peers, regardless where they are located
2105 in the hierarchy. This makes subtree delegation impossible. Second,
2106 the soft limit reclaim pass is so aggressive that it not just
2107 introduces high allocation latencies into the system, but also impacts
2108 system performance due to overreclaim, to the point where the feature
2109 becomes self-defeating.
2111 The memory.low boundary on the other hand is a top-down allocated
2112 reserve. A cgroup enjoys reclaim protection when it's within its low,
2113 which makes delegation of subtrees possible.
2115 The original high boundary, the hard limit, is defined as a strict
2116 limit that can not budge, even if the OOM killer has to be called.
2117 But this generally goes against the goal of making the most out of the
2118 available memory. The memory consumption of workloads varies during
2119 runtime, and that requires users to overcommit. But doing that with a
2120 strict upper limit requires either a fairly accurate prediction of the
2121 working set size or adding slack to the limit. Since working set size
2122 estimation is hard and error prone, and getting it wrong results in
2123 OOM kills, most users tend to err on the side of a looser limit and
2124 end up wasting precious resources.
2126 The memory.high boundary on the other hand can be set much more
2127 conservatively. When hit, it throttles allocations by forcing them
2128 into direct reclaim to work off the excess, but it never invokes the
2129 OOM killer. As a result, a high boundary that is chosen too
2130 aggressively will not terminate the processes, but instead it will
2131 lead to gradual performance degradation. The user can monitor this
2132 and make corrections until the minimal memory footprint that still
2133 gives acceptable performance is found.
2135 In extreme cases, with many concurrent allocations and a complete
2136 breakdown of reclaim progress within the group, the high boundary can
2137 be exceeded. But even then it's mostly better to satisfy the
2138 allocation from the slack available in other groups or the rest of the
2139 system than killing the group. Otherwise, memory.max is there to
2140 limit this type of spillover and ultimately contain buggy or even
2141 malicious applications.
2143 Setting the original memory.limit_in_bytes below the current usage was
2144 subject to a race condition, where concurrent charges could cause the
2145 limit setting to fail. memory.max on the other hand will first set the
2146 limit to prevent new charges, and then reclaim and OOM kill until the
2147 new limit is met - or the task writing to memory.max is killed.
2149 The combined memory+swap accounting and limiting is replaced by real
2150 control over swap space.
2152 The main argument for a combined memory+swap facility in the original
2153 cgroup design was that global or parental pressure would always be
2154 able to swap all anonymous memory of a child group, regardless of the
2155 child's own (possibly untrusted) configuration. However, untrusted
2156 groups can sabotage swapping by other means - such as referencing its
2157 anonymous memory in a tight loop - and an admin can not assume full
2158 swappability when overcommitting untrusted jobs.
2160 For trusted jobs, on the other hand, a combined counter is not an
2161 intuitive userspace interface, and it flies in the face of the idea
2162 that cgroup controllers should account and limit specific physical
2163 resources. Swap space is a resource like all others in the system,
2164 and that's why unified hierarchy allows distributing it separately.