8 :Author: Tejun Heo <tj@kernel.org>
10 This is the authoritative documentation on the design, interface and
11 conventions of cgroup v2. It describes all userland-visible aspects
12 of cgroup including core and specific controller behaviors. All
13 future changes must be reflected in this document. Documentation for
14 v1 is available under :ref:`Documentation/admin-guide/cgroup-v1/index.rst <cgroup-v1>`.
23 2-2. Organizing Processes and Threads
26 2-3. [Un]populated Notification
27 2-4. Controlling Controllers
28 2-4-1. Enabling and Disabling
29 2-4-2. Top-down Constraint
30 2-4-3. No Internal Process Constraint
32 2-5-1. Model of Delegation
33 2-5-2. Delegation Containment
35 2-6-1. Organize Once and Control
36 2-6-2. Avoid Name Collisions
37 3. Resource Distribution Models
45 4-3. Core Interface Files
48 5-1-1. CPU Interface Files
50 5-2-1. Memory Interface Files
51 5-2-2. Usage Guidelines
52 5-2-3. Memory Ownership
54 5-3-1. IO Interface Files
57 5-3-3-1. How IO Latency Throttling Works
58 5-3-3-2. IO Latency Interface Files
61 5-4-1. PID Interface Files
63 5.5-1. Cpuset Interface Files
66 5-7-1. RDMA Interface Files
68 5.8-1. HugeTLB Interface Files
70 5.9-1 Miscellaneous cgroup Interface Files
71 5.9-2 Migration and Ownership
74 5-N. Non-normative information
75 5-N-1. CPU controller root cgroup process behaviour
76 5-N-2. IO controller root cgroup process behaviour
79 6-2. The Root and Views
80 6-3. Migration and setns(2)
81 6-4. Interaction with Other Namespaces
82 P. Information on Kernel Programming
83 P-1. Filesystem Support for Writeback
84 D. Deprecated v1 Core Features
85 R. Issues with v1 and Rationales for v2
86 R-1. Multiple Hierarchies
87 R-2. Thread Granularity
88 R-3. Competition Between Inner Nodes and Threads
89 R-4. Other Interface Issues
90 R-5. Controller Issues and Remedies
100 "cgroup" stands for "control group" and is never capitalized. The
101 singular form is used to designate the whole feature and also as a
102 qualifier as in "cgroup controllers". When explicitly referring to
103 multiple individual control groups, the plural form "cgroups" is used.
109 cgroup is a mechanism to organize processes hierarchically and
110 distribute system resources along the hierarchy in a controlled and
113 cgroup is largely composed of two parts - the core and controllers.
114 cgroup core is primarily responsible for hierarchically organizing
115 processes. A cgroup controller is usually responsible for
116 distributing a specific type of system resource along the hierarchy
117 although there are utility controllers which serve purposes other than
118 resource distribution.
120 cgroups form a tree structure and every process in the system belongs
121 to one and only one cgroup. All threads of a process belong to the
122 same cgroup. On creation, all processes are put in the cgroup that
123 the parent process belongs to at the time. A process can be migrated
124 to another cgroup. Migration of a process doesn't affect already
125 existing descendant processes.
127 Following certain structural constraints, controllers may be enabled or
128 disabled selectively on a cgroup. All controller behaviors are
129 hierarchical - if a controller is enabled on a cgroup, it affects all
130 processes which belong to the cgroups consisting the inclusive
131 sub-hierarchy of the cgroup. When a controller is enabled on a nested
132 cgroup, it always restricts the resource distribution further. The
133 restrictions set closer to the root in the hierarchy can not be
134 overridden from further away.
143 Unlike v1, cgroup v2 has only single hierarchy. The cgroup v2
144 hierarchy can be mounted with the following mount command::
146 # mount -t cgroup2 none $MOUNT_POINT
148 cgroup2 filesystem has the magic number 0x63677270 ("cgrp"). All
149 controllers which support v2 and are not bound to a v1 hierarchy are
150 automatically bound to the v2 hierarchy and show up at the root.
151 Controllers which are not in active use in the v2 hierarchy can be
152 bound to other hierarchies. This allows mixing v2 hierarchy with the
153 legacy v1 multiple hierarchies in a fully backward compatible way.
155 A controller can be moved across hierarchies only after the controller
156 is no longer referenced in its current hierarchy. Because per-cgroup
157 controller states are destroyed asynchronously and controllers may
158 have lingering references, a controller may not show up immediately on
159 the v2 hierarchy after the final umount of the previous hierarchy.
160 Similarly, a controller should be fully disabled to be moved out of
161 the unified hierarchy and it may take some time for the disabled
162 controller to become available for other hierarchies; furthermore, due
163 to inter-controller dependencies, other controllers may need to be
166 While useful for development and manual configurations, moving
167 controllers dynamically between the v2 and other hierarchies is
168 strongly discouraged for production use. It is recommended to decide
169 the hierarchies and controller associations before starting using the
170 controllers after system boot.
172 During transition to v2, system management software might still
173 automount the v1 cgroup filesystem and so hijack all controllers
174 during boot, before manual intervention is possible. To make testing
175 and experimenting easier, the kernel parameter cgroup_no_v1= allows
176 disabling controllers in v1 and make them always available in v2.
178 cgroup v2 currently supports the following mount options.
181 Consider cgroup namespaces as delegation boundaries. This
182 option is system wide and can only be set on mount or modified
183 through remount from the init namespace. The mount option is
184 ignored on non-init namespace mounts. Please refer to the
185 Delegation section for details.
188 Reduce the latencies of dynamic cgroup modifications such as
189 task migrations and controller on/offs at the cost of making
190 hot path operations such as forks and exits more expensive.
191 The static usage pattern of creating a cgroup, enabling
192 controllers, and then seeding it with CLONE_INTO_CGROUP is
193 not affected by this option.
196 Only populate memory.events with data for the current cgroup,
197 and not any subtrees. This is legacy behaviour, the default
198 behaviour without this option is to include subtree counts.
199 This option is system wide and can only be set on mount or
200 modified through remount from the init namespace. The mount
201 option is ignored on non-init namespace mounts.
204 Recursively apply memory.min and memory.low protection to
205 entire subtrees, without requiring explicit downward
206 propagation into leaf cgroups. This allows protecting entire
207 subtrees from one another, while retaining free competition
208 within those subtrees. This should have been the default
209 behavior but is a mount-option to avoid regressing setups
210 relying on the original semantics (e.g. specifying bogusly
211 high 'bypass' protection values at higher tree levels).
213 memory_hugetlb_accounting
214 Count HugeTLB memory usage towards the cgroup's overall
215 memory usage for the memory controller (for the purpose of
216 statistics reporting and memory protetion). This is a new
217 behavior that could regress existing setups, so it must be
218 explicitly opted in with this mount option.
220 A few caveats to keep in mind:
222 * There is no HugeTLB pool management involved in the memory
223 controller. The pre-allocated pool does not belong to anyone.
224 Specifically, when a new HugeTLB folio is allocated to
225 the pool, it is not accounted for from the perspective of the
226 memory controller. It is only charged to a cgroup when it is
227 actually used (for e.g at page fault time). Host memory
228 overcommit management has to consider this when configuring
229 hard limits. In general, HugeTLB pool management should be
230 done via other mechanisms (such as the HugeTLB controller).
231 * Failure to charge a HugeTLB folio to the memory controller
232 results in SIGBUS. This could happen even if the HugeTLB pool
233 still has pages available (but the cgroup limit is hit and
234 reclaim attempt fails).
235 * Charging HugeTLB memory towards the memory controller affects
236 memory protection and reclaim dynamics. Any userspace tuning
237 (of low, min limits for e.g) needs to take this into account.
238 * HugeTLB pages utilized while this option is not selected
239 will not be tracked by the memory controller (even if cgroup
240 v2 is remounted later on).
243 The option restores v1-like behavior of pids.events:max, that is only
244 local (inside cgroup proper) fork failures are counted. Without this
245 option pids.events.max represents any pids.max enforcemnt across
250 Organizing Processes and Threads
251 --------------------------------
256 Initially, only the root cgroup exists to which all processes belong.
257 A child cgroup can be created by creating a sub-directory::
261 A given cgroup may have multiple child cgroups forming a tree
262 structure. Each cgroup has a read-writable interface file
263 "cgroup.procs". When read, it lists the PIDs of all processes which
264 belong to the cgroup one-per-line. The PIDs are not ordered and the
265 same PID may show up more than once if the process got moved to
266 another cgroup and then back or the PID got recycled while reading.
268 A process can be migrated into a cgroup by writing its PID to the
269 target cgroup's "cgroup.procs" file. Only one process can be migrated
270 on a single write(2) call. If a process is composed of multiple
271 threads, writing the PID of any thread migrates all threads of the
274 When a process forks a child process, the new process is born into the
275 cgroup that the forking process belongs to at the time of the
276 operation. After exit, a process stays associated with the cgroup
277 that it belonged to at the time of exit until it's reaped; however, a
278 zombie process does not appear in "cgroup.procs" and thus can't be
279 moved to another cgroup.
281 A cgroup which doesn't have any children or live processes can be
282 destroyed by removing the directory. Note that a cgroup which doesn't
283 have any children and is associated only with zombie processes is
284 considered empty and can be removed::
288 "/proc/$PID/cgroup" lists a process's cgroup membership. If legacy
289 cgroup is in use in the system, this file may contain multiple lines,
290 one for each hierarchy. The entry for cgroup v2 is always in the
293 # cat /proc/842/cgroup
295 0::/test-cgroup/test-cgroup-nested
297 If the process becomes a zombie and the cgroup it was associated with
298 is removed subsequently, " (deleted)" is appended to the path::
300 # cat /proc/842/cgroup
302 0::/test-cgroup/test-cgroup-nested (deleted)
308 cgroup v2 supports thread granularity for a subset of controllers to
309 support use cases requiring hierarchical resource distribution across
310 the threads of a group of processes. By default, all threads of a
311 process belong to the same cgroup, which also serves as the resource
312 domain to host resource consumptions which are not specific to a
313 process or thread. The thread mode allows threads to be spread across
314 a subtree while still maintaining the common resource domain for them.
316 Controllers which support thread mode are called threaded controllers.
317 The ones which don't are called domain controllers.
319 Marking a cgroup threaded makes it join the resource domain of its
320 parent as a threaded cgroup. The parent may be another threaded
321 cgroup whose resource domain is further up in the hierarchy. The root
322 of a threaded subtree, that is, the nearest ancestor which is not
323 threaded, is called threaded domain or thread root interchangeably and
324 serves as the resource domain for the entire subtree.
326 Inside a threaded subtree, threads of a process can be put in
327 different cgroups and are not subject to the no internal process
328 constraint - threaded controllers can be enabled on non-leaf cgroups
329 whether they have threads in them or not.
331 As the threaded domain cgroup hosts all the domain resource
332 consumptions of the subtree, it is considered to have internal
333 resource consumptions whether there are processes in it or not and
334 can't have populated child cgroups which aren't threaded. Because the
335 root cgroup is not subject to no internal process constraint, it can
336 serve both as a threaded domain and a parent to domain cgroups.
338 The current operation mode or type of the cgroup is shown in the
339 "cgroup.type" file which indicates whether the cgroup is a normal
340 domain, a domain which is serving as the domain of a threaded subtree,
341 or a threaded cgroup.
343 On creation, a cgroup is always a domain cgroup and can be made
344 threaded by writing "threaded" to the "cgroup.type" file. The
345 operation is single direction::
347 # echo threaded > cgroup.type
349 Once threaded, the cgroup can't be made a domain again. To enable the
350 thread mode, the following conditions must be met.
352 - As the cgroup will join the parent's resource domain. The parent
353 must either be a valid (threaded) domain or a threaded cgroup.
355 - When the parent is an unthreaded domain, it must not have any domain
356 controllers enabled or populated domain children. The root is
357 exempt from this requirement.
359 Topology-wise, a cgroup can be in an invalid state. Please consider
360 the following topology::
362 A (threaded domain) - B (threaded) - C (domain, just created)
364 C is created as a domain but isn't connected to a parent which can
365 host child domains. C can't be used until it is turned into a
366 threaded cgroup. "cgroup.type" file will report "domain (invalid)" in
367 these cases. Operations which fail due to invalid topology use
368 EOPNOTSUPP as the errno.
370 A domain cgroup is turned into a threaded domain when one of its child
371 cgroup becomes threaded or threaded controllers are enabled in the
372 "cgroup.subtree_control" file while there are processes in the cgroup.
373 A threaded domain reverts to a normal domain when the conditions
376 When read, "cgroup.threads" contains the list of the thread IDs of all
377 threads in the cgroup. Except that the operations are per-thread
378 instead of per-process, "cgroup.threads" has the same format and
379 behaves the same way as "cgroup.procs". While "cgroup.threads" can be
380 written to in any cgroup, as it can only move threads inside the same
381 threaded domain, its operations are confined inside each threaded
384 The threaded domain cgroup serves as the resource domain for the whole
385 subtree, and, while the threads can be scattered across the subtree,
386 all the processes are considered to be in the threaded domain cgroup.
387 "cgroup.procs" in a threaded domain cgroup contains the PIDs of all
388 processes in the subtree and is not readable in the subtree proper.
389 However, "cgroup.procs" can be written to from anywhere in the subtree
390 to migrate all threads of the matching process to the cgroup.
392 Only threaded controllers can be enabled in a threaded subtree. When
393 a threaded controller is enabled inside a threaded subtree, it only
394 accounts for and controls resource consumptions associated with the
395 threads in the cgroup and its descendants. All consumptions which
396 aren't tied to a specific thread belong to the threaded domain cgroup.
398 Because a threaded subtree is exempt from no internal process
399 constraint, a threaded controller must be able to handle competition
400 between threads in a non-leaf cgroup and its child cgroups. Each
401 threaded controller defines how such competitions are handled.
403 Currently, the following controllers are threaded and can be enabled
404 in a threaded cgroup::
411 [Un]populated Notification
412 --------------------------
414 Each non-root cgroup has a "cgroup.events" file which contains
415 "populated" field indicating whether the cgroup's sub-hierarchy has
416 live processes in it. Its value is 0 if there is no live process in
417 the cgroup and its descendants; otherwise, 1. poll and [id]notify
418 events are triggered when the value changes. This can be used, for
419 example, to start a clean-up operation after all processes of a given
420 sub-hierarchy have exited. The populated state updates and
421 notifications are recursive. Consider the following sub-hierarchy
422 where the numbers in the parentheses represent the numbers of processes
428 A, B and C's "populated" fields would be 1 while D's 0. After the one
429 process in C exits, B and C's "populated" fields would flip to "0" and
430 file modified events will be generated on the "cgroup.events" files of
434 Controlling Controllers
435 -----------------------
437 Enabling and Disabling
438 ~~~~~~~~~~~~~~~~~~~~~~
440 Each cgroup has a "cgroup.controllers" file which lists all
441 controllers available for the cgroup to enable::
443 # cat cgroup.controllers
446 No controller is enabled by default. Controllers can be enabled and
447 disabled by writing to the "cgroup.subtree_control" file::
449 # echo "+cpu +memory -io" > cgroup.subtree_control
451 Only controllers which are listed in "cgroup.controllers" can be
452 enabled. When multiple operations are specified as above, either they
453 all succeed or fail. If multiple operations on the same controller
454 are specified, the last one is effective.
456 Enabling a controller in a cgroup indicates that the distribution of
457 the target resource across its immediate children will be controlled.
458 Consider the following sub-hierarchy. The enabled controllers are
459 listed in parentheses::
461 A(cpu,memory) - B(memory) - C()
464 As A has "cpu" and "memory" enabled, A will control the distribution
465 of CPU cycles and memory to its children, in this case, B. As B has
466 "memory" enabled but not "CPU", C and D will compete freely on CPU
467 cycles but their division of memory available to B will be controlled.
469 As a controller regulates the distribution of the target resource to
470 the cgroup's children, enabling it creates the controller's interface
471 files in the child cgroups. In the above example, enabling "cpu" on B
472 would create the "cpu." prefixed controller interface files in C and
473 D. Likewise, disabling "memory" from B would remove the "memory."
474 prefixed controller interface files from C and D. This means that the
475 controller interface files - anything which doesn't start with
476 "cgroup." are owned by the parent rather than the cgroup itself.
482 Resources are distributed top-down and a cgroup can further distribute
483 a resource only if the resource has been distributed to it from the
484 parent. This means that all non-root "cgroup.subtree_control" files
485 can only contain controllers which are enabled in the parent's
486 "cgroup.subtree_control" file. A controller can be enabled only if
487 the parent has the controller enabled and a controller can't be
488 disabled if one or more children have it enabled.
491 No Internal Process Constraint
492 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
494 Non-root cgroups can distribute domain resources to their children
495 only when they don't have any processes of their own. In other words,
496 only domain cgroups which don't contain any processes can have domain
497 controllers enabled in their "cgroup.subtree_control" files.
499 This guarantees that, when a domain controller is looking at the part
500 of the hierarchy which has it enabled, processes are always only on
501 the leaves. This rules out situations where child cgroups compete
502 against internal processes of the parent.
504 The root cgroup is exempt from this restriction. Root contains
505 processes and anonymous resource consumption which can't be associated
506 with any other cgroups and requires special treatment from most
507 controllers. How resource consumption in the root cgroup is governed
508 is up to each controller (for more information on this topic please
509 refer to the Non-normative information section in the Controllers
512 Note that the restriction doesn't get in the way if there is no
513 enabled controller in the cgroup's "cgroup.subtree_control". This is
514 important as otherwise it wouldn't be possible to create children of a
515 populated cgroup. To control resource distribution of a cgroup, the
516 cgroup must create children and transfer all its processes to the
517 children before enabling controllers in its "cgroup.subtree_control"
527 A cgroup can be delegated in two ways. First, to a less privileged
528 user by granting write access of the directory and its "cgroup.procs",
529 "cgroup.threads" and "cgroup.subtree_control" files to the user.
530 Second, if the "nsdelegate" mount option is set, automatically to a
531 cgroup namespace on namespace creation.
533 Because the resource control interface files in a given directory
534 control the distribution of the parent's resources, the delegatee
535 shouldn't be allowed to write to them. For the first method, this is
536 achieved by not granting access to these files. For the second, files
537 outside the namespace should be hidden from the delegatee by the means
538 of at least mount namespacing, and the kernel rejects writes to all
539 files on a namespace root from inside the cgroup namespace, except for
540 those files listed in "/sys/kernel/cgroup/delegate" (including
541 "cgroup.procs", "cgroup.threads", "cgroup.subtree_control", etc.).
543 The end results are equivalent for both delegation types. Once
544 delegated, the user can build sub-hierarchy under the directory,
545 organize processes inside it as it sees fit and further distribute the
546 resources it received from the parent. The limits and other settings
547 of all resource controllers are hierarchical and regardless of what
548 happens in the delegated sub-hierarchy, nothing can escape the
549 resource restrictions imposed by the parent.
551 Currently, cgroup doesn't impose any restrictions on the number of
552 cgroups in or nesting depth of a delegated sub-hierarchy; however,
553 this may be limited explicitly in the future.
556 Delegation Containment
557 ~~~~~~~~~~~~~~~~~~~~~~
559 A delegated sub-hierarchy is contained in the sense that processes
560 can't be moved into or out of the sub-hierarchy by the delegatee.
562 For delegations to a less privileged user, this is achieved by
563 requiring the following conditions for a process with a non-root euid
564 to migrate a target process into a cgroup by writing its PID to the
567 - The writer must have write access to the "cgroup.procs" file.
569 - The writer must have write access to the "cgroup.procs" file of the
570 common ancestor of the source and destination cgroups.
572 The above two constraints ensure that while a delegatee may migrate
573 processes around freely in the delegated sub-hierarchy it can't pull
574 in from or push out to outside the sub-hierarchy.
576 For an example, let's assume cgroups C0 and C1 have been delegated to
577 user U0 who created C00, C01 under C0 and C10 under C1 as follows and
578 all processes under C0 and C1 belong to U0::
580 ~~~~~~~~~~~~~ - C0 - C00
583 ~~~~~~~~~~~~~ - C1 - C10
585 Let's also say U0 wants to write the PID of a process which is
586 currently in C10 into "C00/cgroup.procs". U0 has write access to the
587 file; however, the common ancestor of the source cgroup C10 and the
588 destination cgroup C00 is above the points of delegation and U0 would
589 not have write access to its "cgroup.procs" files and thus the write
590 will be denied with -EACCES.
592 For delegations to namespaces, containment is achieved by requiring
593 that both the source and destination cgroups are reachable from the
594 namespace of the process which is attempting the migration. If either
595 is not reachable, the migration is rejected with -ENOENT.
601 Organize Once and Control
602 ~~~~~~~~~~~~~~~~~~~~~~~~~
604 Migrating a process across cgroups is a relatively expensive operation
605 and stateful resources such as memory are not moved together with the
606 process. This is an explicit design decision as there often exist
607 inherent trade-offs between migration and various hot paths in terms
608 of synchronization cost.
610 As such, migrating processes across cgroups frequently as a means to
611 apply different resource restrictions is discouraged. A workload
612 should be assigned to a cgroup according to the system's logical and
613 resource structure once on start-up. Dynamic adjustments to resource
614 distribution can be made by changing controller configuration through
618 Avoid Name Collisions
619 ~~~~~~~~~~~~~~~~~~~~~
621 Interface files for a cgroup and its children cgroups occupy the same
622 directory and it is possible to create children cgroups which collide
623 with interface files.
625 All cgroup core interface files are prefixed with "cgroup." and each
626 controller's interface files are prefixed with the controller name and
627 a dot. A controller's name is composed of lower case alphabets and
628 '_'s but never begins with an '_' so it can be used as the prefix
629 character for collision avoidance. Also, interface file names won't
630 start or end with terms which are often used in categorizing workloads
631 such as job, service, slice, unit or workload.
633 cgroup doesn't do anything to prevent name collisions and it's the
634 user's responsibility to avoid them.
637 Resource Distribution Models
638 ============================
640 cgroup controllers implement several resource distribution schemes
641 depending on the resource type and expected use cases. This section
642 describes major schemes in use along with their expected behaviors.
648 A parent's resource is distributed by adding up the weights of all
649 active children and giving each the fraction matching the ratio of its
650 weight against the sum. As only children which can make use of the
651 resource at the moment participate in the distribution, this is
652 work-conserving. Due to the dynamic nature, this model is usually
653 used for stateless resources.
655 All weights are in the range [1, 10000] with the default at 100. This
656 allows symmetric multiplicative biases in both directions at fine
657 enough granularity while staying in the intuitive range.
659 As long as the weight is in range, all configuration combinations are
660 valid and there is no reason to reject configuration changes or
663 "cpu.weight" proportionally distributes CPU cycles to active children
664 and is an example of this type.
667 .. _cgroupv2-limits-distributor:
672 A child can only consume up to the configured amount of the resource.
673 Limits can be over-committed - the sum of the limits of children can
674 exceed the amount of resource available to the parent.
676 Limits are in the range [0, max] and defaults to "max", which is noop.
678 As limits can be over-committed, all configuration combinations are
679 valid and there is no reason to reject configuration changes or
682 "io.max" limits the maximum BPS and/or IOPS that a cgroup can consume
683 on an IO device and is an example of this type.
685 .. _cgroupv2-protections-distributor:
690 A cgroup is protected up to the configured amount of the resource
691 as long as the usages of all its ancestors are under their
692 protected levels. Protections can be hard guarantees or best effort
693 soft boundaries. Protections can also be over-committed in which case
694 only up to the amount available to the parent is protected among
697 Protections are in the range [0, max] and defaults to 0, which is
700 As protections can be over-committed, all configuration combinations
701 are valid and there is no reason to reject configuration changes or
704 "memory.low" implements best-effort memory protection and is an
705 example of this type.
711 A cgroup is exclusively allocated a certain amount of a finite
712 resource. Allocations can't be over-committed - the sum of the
713 allocations of children can not exceed the amount of resource
714 available to the parent.
716 Allocations are in the range [0, max] and defaults to 0, which is no
719 As allocations can't be over-committed, some configuration
720 combinations are invalid and should be rejected. Also, if the
721 resource is mandatory for execution of processes, process migrations
724 "cpu.rt.max" hard-allocates realtime slices and is an example of this
734 All interface files should be in one of the following formats whenever
737 New-line separated values
738 (when only one value can be written at once)
744 Space separated values
745 (when read-only or multiple values can be written at once)
757 KEY0 SUB_KEY0=VAL00 SUB_KEY1=VAL01...
758 KEY1 SUB_KEY0=VAL10 SUB_KEY1=VAL11...
761 For a writable file, the format for writing should generally match
762 reading; however, controllers may allow omitting later fields or
763 implement restricted shortcuts for most common use cases.
765 For both flat and nested keyed files, only the values for a single key
766 can be written at a time. For nested keyed files, the sub key pairs
767 may be specified in any order and not all pairs have to be specified.
773 - Settings for a single feature should be contained in a single file.
775 - The root cgroup should be exempt from resource control and thus
776 shouldn't have resource control interface files.
778 - The default time unit is microseconds. If a different unit is ever
779 used, an explicit unit suffix must be present.
781 - A parts-per quantity should use a percentage decimal with at least
782 two digit fractional part - e.g. 13.40.
784 - If a controller implements weight based resource distribution, its
785 interface file should be named "weight" and have the range [1,
786 10000] with 100 as the default. The values are chosen to allow
787 enough and symmetric bias in both directions while keeping it
788 intuitive (the default is 100%).
790 - If a controller implements an absolute resource guarantee and/or
791 limit, the interface files should be named "min" and "max"
792 respectively. If a controller implements best effort resource
793 guarantee and/or limit, the interface files should be named "low"
794 and "high" respectively.
796 In the above four control files, the special token "max" should be
797 used to represent upward infinity for both reading and writing.
799 - If a setting has a configurable default value and keyed specific
800 overrides, the default entry should be keyed with "default" and
801 appear as the first entry in the file.
803 The default value can be updated by writing either "default $VAL" or
806 When writing to update a specific override, "default" can be used as
807 the value to indicate removal of the override. Override entries
808 with "default" as the value must not appear when read.
810 For example, a setting which is keyed by major:minor device numbers
811 with integer values may look like the following::
813 # cat cgroup-example-interface-file
817 The default value can be updated by::
819 # echo 125 > cgroup-example-interface-file
823 # echo "default 125" > cgroup-example-interface-file
825 An override can be set by::
827 # echo "8:16 170" > cgroup-example-interface-file
831 # echo "8:0 default" > cgroup-example-interface-file
832 # cat cgroup-example-interface-file
836 - For events which are not very high frequency, an interface file
837 "events" should be created which lists event key value pairs.
838 Whenever a notifiable event happens, file modified event should be
839 generated on the file.
845 All cgroup core files are prefixed with "cgroup."
848 A read-write single value file which exists on non-root
851 When read, it indicates the current type of the cgroup, which
852 can be one of the following values.
854 - "domain" : A normal valid domain cgroup.
856 - "domain threaded" : A threaded domain cgroup which is
857 serving as the root of a threaded subtree.
859 - "domain invalid" : A cgroup which is in an invalid state.
860 It can't be populated or have controllers enabled. It may
861 be allowed to become a threaded cgroup.
863 - "threaded" : A threaded cgroup which is a member of a
866 A cgroup can be turned into a threaded cgroup by writing
867 "threaded" to this file.
870 A read-write new-line separated values file which exists on
873 When read, it lists the PIDs of all processes which belong to
874 the cgroup one-per-line. The PIDs are not ordered and the
875 same PID may show up more than once if the process got moved
876 to another cgroup and then back or the PID got recycled while
879 A PID can be written to migrate the process associated with
880 the PID to the cgroup. The writer should match all of the
881 following conditions.
883 - It must have write access to the "cgroup.procs" file.
885 - It must have write access to the "cgroup.procs" file of the
886 common ancestor of the source and destination cgroups.
888 When delegating a sub-hierarchy, write access to this file
889 should be granted along with the containing directory.
891 In a threaded cgroup, reading this file fails with EOPNOTSUPP
892 as all the processes belong to the thread root. Writing is
893 supported and moves every thread of the process to the cgroup.
896 A read-write new-line separated values file which exists on
899 When read, it lists the TIDs of all threads which belong to
900 the cgroup one-per-line. The TIDs are not ordered and the
901 same TID may show up more than once if the thread got moved to
902 another cgroup and then back or the TID got recycled while
905 A TID can be written to migrate the thread associated with the
906 TID to the cgroup. The writer should match all of the
907 following conditions.
909 - It must have write access to the "cgroup.threads" file.
911 - The cgroup that the thread is currently in must be in the
912 same resource domain as the destination cgroup.
914 - It must have write access to the "cgroup.procs" file of the
915 common ancestor of the source and destination cgroups.
917 When delegating a sub-hierarchy, write access to this file
918 should be granted along with the containing directory.
921 A read-only space separated values file which exists on all
924 It shows space separated list of all controllers available to
925 the cgroup. The controllers are not ordered.
927 cgroup.subtree_control
928 A read-write space separated values file which exists on all
929 cgroups. Starts out empty.
931 When read, it shows space separated list of the controllers
932 which are enabled to control resource distribution from the
933 cgroup to its children.
935 Space separated list of controllers prefixed with '+' or '-'
936 can be written to enable or disable controllers. A controller
937 name prefixed with '+' enables the controller and '-'
938 disables. If a controller appears more than once on the list,
939 the last one is effective. When multiple enable and disable
940 operations are specified, either all succeed or all fail.
943 A read-only flat-keyed file which exists on non-root cgroups.
944 The following entries are defined. Unless specified
945 otherwise, a value change in this file generates a file
949 1 if the cgroup or its descendants contains any live
950 processes; otherwise, 0.
952 1 if the cgroup is frozen; otherwise, 0.
954 cgroup.max.descendants
955 A read-write single value files. The default is "max".
957 Maximum allowed number of descent cgroups.
958 If the actual number of descendants is equal or larger,
959 an attempt to create a new cgroup in the hierarchy will fail.
962 A read-write single value files. The default is "max".
964 Maximum allowed descent depth below the current cgroup.
965 If the actual descent depth is equal or larger,
966 an attempt to create a new child cgroup will fail.
969 A read-only flat-keyed file with the following entries:
972 Total number of visible descendant cgroups.
975 Total number of dying descendant cgroups. A cgroup becomes
976 dying after being deleted by a user. The cgroup will remain
977 in dying state for some time undefined time (which can depend
978 on system load) before being completely destroyed.
980 A process can't enter a dying cgroup under any circumstances,
981 a dying cgroup can't revive.
983 A dying cgroup can consume system resources not exceeding
984 limits, which were active at the moment of cgroup deletion.
986 nr_subsys_<cgroup_subsys>
987 Total number of live cgroup subsystems (e.g memory
988 cgroup) at and beneath the current cgroup.
990 nr_dying_subsys_<cgroup_subsys>
991 Total number of dying cgroup subsystems (e.g. memory
992 cgroup) at and beneath the current cgroup.
995 A read-write single value file which exists on non-root cgroups.
996 Allowed values are "0" and "1". The default is "0".
998 Writing "1" to the file causes freezing of the cgroup and all
999 descendant cgroups. This means that all belonging processes will
1000 be stopped and will not run until the cgroup will be explicitly
1001 unfrozen. Freezing of the cgroup may take some time; when this action
1002 is completed, the "frozen" value in the cgroup.events control file
1003 will be updated to "1" and the corresponding notification will be
1006 A cgroup can be frozen either by its own settings, or by settings
1007 of any ancestor cgroups. If any of ancestor cgroups is frozen, the
1008 cgroup will remain frozen.
1010 Processes in the frozen cgroup can be killed by a fatal signal.
1011 They also can enter and leave a frozen cgroup: either by an explicit
1012 move by a user, or if freezing of the cgroup races with fork().
1013 If a process is moved to a frozen cgroup, it stops. If a process is
1014 moved out of a frozen cgroup, it becomes running.
1016 Frozen status of a cgroup doesn't affect any cgroup tree operations:
1017 it's possible to delete a frozen (and empty) cgroup, as well as
1018 create new sub-cgroups.
1021 A write-only single value file which exists in non-root cgroups.
1022 The only allowed value is "1".
1024 Writing "1" to the file causes the cgroup and all descendant cgroups to
1025 be killed. This means that all processes located in the affected cgroup
1026 tree will be killed via SIGKILL.
1028 Killing a cgroup tree will deal with concurrent forks appropriately and
1029 is protected against migrations.
1031 In a threaded cgroup, writing this file fails with EOPNOTSUPP as
1032 killing cgroups is a process directed operation, i.e. it affects
1033 the whole thread-group.
1036 A read-write single value file that allowed values are "0" and "1".
1039 Writing "0" to the file will disable the cgroup PSI accounting.
1040 Writing "1" to the file will re-enable the cgroup PSI accounting.
1042 This control attribute is not hierarchical, so disable or enable PSI
1043 accounting in a cgroup does not affect PSI accounting in descendants
1044 and doesn't need pass enablement via ancestors from root.
1046 The reason this control attribute exists is that PSI accounts stalls for
1047 each cgroup separately and aggregates it at each level of the hierarchy.
1048 This may cause non-negligible overhead for some workloads when under
1049 deep level of the hierarchy, in which case this control attribute can
1050 be used to disable PSI accounting in the non-leaf cgroups.
1053 A read-write nested-keyed file.
1055 Shows pressure stall information for IRQ/SOFTIRQ. See
1056 :ref:`Documentation/accounting/psi.rst <psi>` for details.
1066 The "cpu" controllers regulates distribution of CPU cycles. This
1067 controller implements weight and absolute bandwidth limit models for
1068 normal scheduling policy and absolute bandwidth allocation model for
1069 realtime scheduling policy.
1071 In all the above models, cycles distribution is defined only on a temporal
1072 base and it does not account for the frequency at which tasks are executed.
1073 The (optional) utilization clamping support allows to hint the schedutil
1074 cpufreq governor about the minimum desired frequency which should always be
1075 provided by a CPU, as well as the maximum desired frequency, which should not
1076 be exceeded by a CPU.
1078 WARNING: cgroup2 doesn't yet support control of realtime processes. For
1079 a kernel built with the CONFIG_RT_GROUP_SCHED option enabled for group
1080 scheduling of realtime processes, the cpu controller can only be enabled
1081 when all RT processes are in the root cgroup. This limitation does
1082 not apply if CONFIG_RT_GROUP_SCHED is disabled. Be aware that system
1083 management software may already have placed RT processes into nonroot
1084 cgroups during the system boot process, and these processes may need
1085 to be moved to the root cgroup before the cpu controller can be enabled
1086 with a CONFIG_RT_GROUP_SCHED enabled kernel.
1092 All time durations are in microseconds.
1095 A read-only flat-keyed file.
1096 This file exists whether the controller is enabled or not.
1098 It always reports the following three stats:
1104 and the following five when the controller is enabled:
1113 A read-write single value file which exists on non-root
1114 cgroups. The default is "100".
1116 For non idle groups (cpu.idle = 0), the weight is in the
1119 If the cgroup has been configured to be SCHED_IDLE (cpu.idle = 1),
1120 then the weight will show as a 0.
1123 A read-write single value file which exists on non-root
1124 cgroups. The default is "0".
1126 The nice value is in the range [-20, 19].
1128 This interface file is an alternative interface for
1129 "cpu.weight" and allows reading and setting weight using the
1130 same values used by nice(2). Because the range is smaller and
1131 granularity is coarser for the nice values, the read value is
1132 the closest approximation of the current weight.
1135 A read-write two value file which exists on non-root cgroups.
1136 The default is "max 100000".
1138 The maximum bandwidth limit. It's in the following format::
1142 which indicates that the group may consume up to $MAX in each
1143 $PERIOD duration. "max" for $MAX indicates no limit. If only
1144 one number is written, $MAX is updated.
1147 A read-write single value file which exists on non-root
1148 cgroups. The default is "0".
1150 The burst in the range [0, $MAX].
1153 A read-write nested-keyed file.
1155 Shows pressure stall information for CPU. See
1156 :ref:`Documentation/accounting/psi.rst <psi>` for details.
1159 A read-write single value file which exists on non-root cgroups.
1160 The default is "0", i.e. no utilization boosting.
1162 The requested minimum utilization (protection) as a percentage
1163 rational number, e.g. 12.34 for 12.34%.
1165 This interface allows reading and setting minimum utilization clamp
1166 values similar to the sched_setattr(2). This minimum utilization
1167 value is used to clamp the task specific minimum utilization clamp.
1169 The requested minimum utilization (protection) is always capped by
1170 the current value for the maximum utilization (limit), i.e.
1174 A read-write single value file which exists on non-root cgroups.
1175 The default is "max". i.e. no utilization capping
1177 The requested maximum utilization (limit) as a percentage rational
1178 number, e.g. 98.76 for 98.76%.
1180 This interface allows reading and setting maximum utilization clamp
1181 values similar to the sched_setattr(2). This maximum utilization
1182 value is used to clamp the task specific maximum utilization clamp.
1185 A read-write single value file which exists on non-root cgroups.
1188 This is the cgroup analog of the per-task SCHED_IDLE sched policy.
1189 Setting this value to a 1 will make the scheduling policy of the
1190 cgroup SCHED_IDLE. The threads inside the cgroup will retain their
1191 own relative priorities, but the cgroup itself will be treated as
1192 very low priority relative to its peers.
1199 The "memory" controller regulates distribution of memory. Memory is
1200 stateful and implements both limit and protection models. Due to the
1201 intertwining between memory usage and reclaim pressure and the
1202 stateful nature of memory, the distribution model is relatively
1205 While not completely water-tight, all major memory usages by a given
1206 cgroup are tracked so that the total memory consumption can be
1207 accounted and controlled to a reasonable extent. Currently, the
1208 following types of memory usages are tracked.
1210 - Userland memory - page cache and anonymous memory.
1212 - Kernel data structures such as dentries and inodes.
1214 - TCP socket buffers.
1216 The above list may expand in the future for better coverage.
1219 Memory Interface Files
1220 ~~~~~~~~~~~~~~~~~~~~~~
1222 All memory amounts are in bytes. If a value which is not aligned to
1223 PAGE_SIZE is written, the value may be rounded up to the closest
1224 PAGE_SIZE multiple when read back.
1227 A read-only single value file which exists on non-root
1230 The total amount of memory currently being used by the cgroup
1231 and its descendants.
1234 A read-write single value file which exists on non-root
1235 cgroups. The default is "0".
1237 Hard memory protection. If the memory usage of a cgroup
1238 is within its effective min boundary, the cgroup's memory
1239 won't be reclaimed under any conditions. If there is no
1240 unprotected reclaimable memory available, OOM killer
1241 is invoked. Above the effective min boundary (or
1242 effective low boundary if it is higher), pages are reclaimed
1243 proportionally to the overage, reducing reclaim pressure for
1246 Effective min boundary is limited by memory.min values of
1247 all ancestor cgroups. If there is memory.min overcommitment
1248 (child cgroup or cgroups are requiring more protected memory
1249 than parent will allow), then each child cgroup will get
1250 the part of parent's protection proportional to its
1251 actual memory usage below memory.min.
1253 Putting more memory than generally available under this
1254 protection is discouraged and may lead to constant OOMs.
1256 If a memory cgroup is not populated with processes,
1257 its memory.min is ignored.
1260 A read-write single value file which exists on non-root
1261 cgroups. The default is "0".
1263 Best-effort memory protection. If the memory usage of a
1264 cgroup is within its effective low boundary, the cgroup's
1265 memory won't be reclaimed unless there is no reclaimable
1266 memory available in unprotected cgroups.
1267 Above the effective low boundary (or
1268 effective min boundary if it is higher), pages are reclaimed
1269 proportionally to the overage, reducing reclaim pressure for
1272 Effective low boundary is limited by memory.low values of
1273 all ancestor cgroups. If there is memory.low overcommitment
1274 (child cgroup or cgroups are requiring more protected memory
1275 than parent will allow), then each child cgroup will get
1276 the part of parent's protection proportional to its
1277 actual memory usage below memory.low.
1279 Putting more memory than generally available under this
1280 protection is discouraged.
1283 A read-write single value file which exists on non-root
1284 cgroups. The default is "max".
1286 Memory usage throttle limit. If a cgroup's usage goes
1287 over the high boundary, the processes of the cgroup are
1288 throttled and put under heavy reclaim pressure.
1290 Going over the high limit never invokes the OOM killer and
1291 under extreme conditions the limit may be breached. The high
1292 limit should be used in scenarios where an external process
1293 monitors the limited cgroup to alleviate heavy reclaim
1297 A read-write single value file which exists on non-root
1298 cgroups. The default is "max".
1300 Memory usage hard limit. This is the main mechanism to limit
1301 memory usage of a cgroup. If a cgroup's memory usage reaches
1302 this limit and can't be reduced, the OOM killer is invoked in
1303 the cgroup. Under certain circumstances, the usage may go
1304 over the limit temporarily.
1306 In default configuration regular 0-order allocations always
1307 succeed unless OOM killer chooses current task as a victim.
1309 Some kinds of allocations don't invoke the OOM killer.
1310 Caller could retry them differently, return into userspace
1311 as -ENOMEM or silently ignore in cases like disk readahead.
1314 A write-only nested-keyed file which exists for all cgroups.
1316 This is a simple interface to trigger memory reclaim in the
1321 echo "1G" > memory.reclaim
1323 Please note that the kernel can over or under reclaim from
1324 the target cgroup. If less bytes are reclaimed than the
1325 specified amount, -EAGAIN is returned.
1327 Please note that the proactive reclaim (triggered by this
1328 interface) is not meant to indicate memory pressure on the
1329 memory cgroup. Therefore socket memory balancing triggered by
1330 the memory reclaim normally is not exercised in this case.
1331 This means that the networking layer will not adapt based on
1332 reclaim induced by memory.reclaim.
1334 The following nested keys are defined.
1336 ========== ================================
1337 swappiness Swappiness value to reclaim with
1338 ========== ================================
1340 Specifying a swappiness value instructs the kernel to perform
1341 the reclaim with that swappiness value. Note that this has the
1342 same semantics as vm.swappiness applied to memcg reclaim with
1343 all the existing limitations and potential future extensions.
1346 A read-write single value file which exists on non-root cgroups.
1348 The max memory usage recorded for the cgroup and its descendants since
1349 either the creation of the cgroup or the most recent reset for that FD.
1351 A write of any non-empty string to this file resets it to the
1352 current memory usage for subsequent reads through the same
1356 A read-write single value file which exists on non-root
1357 cgroups. The default value is "0".
1359 Determines whether the cgroup should be treated as
1360 an indivisible workload by the OOM killer. If set,
1361 all tasks belonging to the cgroup or to its descendants
1362 (if the memory cgroup is not a leaf cgroup) are killed
1363 together or not at all. This can be used to avoid
1364 partial kills to guarantee workload integrity.
1366 Tasks with the OOM protection (oom_score_adj set to -1000)
1367 are treated as an exception and are never killed.
1369 If the OOM killer is invoked in a cgroup, it's not going
1370 to kill any tasks outside of this cgroup, regardless
1371 memory.oom.group values of ancestor cgroups.
1374 A read-only flat-keyed file which exists on non-root cgroups.
1375 The following entries are defined. Unless specified
1376 otherwise, a value change in this file generates a file
1379 Note that all fields in this file are hierarchical and the
1380 file modified event can be generated due to an event down the
1381 hierarchy. For the local events at the cgroup level see
1382 memory.events.local.
1385 The number of times the cgroup is reclaimed due to
1386 high memory pressure even though its usage is under
1387 the low boundary. This usually indicates that the low
1388 boundary is over-committed.
1391 The number of times processes of the cgroup are
1392 throttled and routed to perform direct memory reclaim
1393 because the high memory boundary was exceeded. For a
1394 cgroup whose memory usage is capped by the high limit
1395 rather than global memory pressure, this event's
1396 occurrences are expected.
1399 The number of times the cgroup's memory usage was
1400 about to go over the max boundary. If direct reclaim
1401 fails to bring it down, the cgroup goes to OOM state.
1404 The number of time the cgroup's memory usage was
1405 reached the limit and allocation was about to fail.
1407 This event is not raised if the OOM killer is not
1408 considered as an option, e.g. for failed high-order
1409 allocations or if caller asked to not retry attempts.
1412 The number of processes belonging to this cgroup
1413 killed by any kind of OOM killer.
1416 The number of times a group OOM has occurred.
1419 Similar to memory.events but the fields in the file are local
1420 to the cgroup i.e. not hierarchical. The file modified event
1421 generated on this file reflects only the local events.
1424 A read-only flat-keyed file which exists on non-root cgroups.
1426 This breaks down the cgroup's memory footprint into different
1427 types of memory, type-specific details, and other information
1428 on the state and past events of the memory management system.
1430 All memory amounts are in bytes.
1432 The entries are ordered to be human readable, and new entries
1433 can show up in the middle. Don't rely on items remaining in a
1434 fixed position; use the keys to look up specific values!
1436 If the entry has no per-node counter (or not show in the
1437 memory.numa_stat). We use 'npn' (non-per-node) as the tag
1438 to indicate that it will not show in the memory.numa_stat.
1441 Amount of memory used in anonymous mappings such as
1442 brk(), sbrk(), and mmap(MAP_ANONYMOUS)
1445 Amount of memory used to cache filesystem data,
1446 including tmpfs and shared memory.
1449 Amount of total kernel memory, including
1450 (kernel_stack, pagetables, percpu, vmalloc, slab) in
1451 addition to other kernel memory use cases.
1454 Amount of memory allocated to kernel stacks.
1457 Amount of memory allocated for page tables.
1460 Amount of memory allocated for secondary page tables,
1461 this currently includes KVM mmu allocations on x86
1462 and arm64 and IOMMU page tables.
1465 Amount of memory used for storing per-cpu kernel
1469 Amount of memory used in network transmission buffers
1472 Amount of memory used for vmap backed memory.
1475 Amount of cached filesystem data that is swap-backed,
1476 such as tmpfs, shm segments, shared anonymous mmap()s
1479 Amount of memory consumed by the zswap compression backend.
1482 Amount of application memory swapped out to zswap.
1485 Amount of cached filesystem data mapped with mmap()
1488 Amount of cached filesystem data that was modified but
1489 not yet written back to disk
1492 Amount of cached filesystem data that was modified and
1493 is currently being written back to disk
1496 Amount of swap cached in memory. The swapcache is accounted
1497 against both memory and swap usage.
1500 Amount of memory used in anonymous mappings backed by
1501 transparent hugepages
1504 Amount of cached filesystem data backed by transparent
1508 Amount of shm, tmpfs, shared anonymous mmap()s backed by
1509 transparent hugepages
1511 inactive_anon, active_anon, inactive_file, active_file, unevictable
1512 Amount of memory, swap-backed and filesystem-backed,
1513 on the internal memory management lists used by the
1514 page reclaim algorithm.
1516 As these represent internal list state (eg. shmem pages are on anon
1517 memory management lists), inactive_foo + active_foo may not be equal to
1518 the value for the foo counter, since the foo counter is type-based, not
1522 Part of "slab" that might be reclaimed, such as
1523 dentries and inodes.
1526 Part of "slab" that cannot be reclaimed on memory
1530 Amount of memory used for storing in-kernel data
1533 workingset_refault_anon
1534 Number of refaults of previously evicted anonymous pages.
1536 workingset_refault_file
1537 Number of refaults of previously evicted file pages.
1539 workingset_activate_anon
1540 Number of refaulted anonymous pages that were immediately
1543 workingset_activate_file
1544 Number of refaulted file pages that were immediately activated.
1546 workingset_restore_anon
1547 Number of restored anonymous pages which have been detected as
1548 an active workingset before they got reclaimed.
1550 workingset_restore_file
1551 Number of restored file pages which have been detected as an
1552 active workingset before they got reclaimed.
1554 workingset_nodereclaim
1555 Number of times a shadow node has been reclaimed
1558 Amount of scanned pages (in an inactive LRU list)
1561 Amount of reclaimed pages
1564 Amount of scanned pages by kswapd (in an inactive LRU list)
1567 Amount of scanned pages directly (in an inactive LRU list)
1569 pgscan_khugepaged (npn)
1570 Amount of scanned pages by khugepaged (in an inactive LRU list)
1572 pgsteal_kswapd (npn)
1573 Amount of reclaimed pages by kswapd
1575 pgsteal_direct (npn)
1576 Amount of reclaimed pages directly
1578 pgsteal_khugepaged (npn)
1579 Amount of reclaimed pages by khugepaged
1582 Total number of page faults incurred
1585 Number of major page faults incurred
1588 Amount of scanned pages (in an active LRU list)
1591 Amount of pages moved to the active LRU list
1594 Amount of pages moved to the inactive LRU list
1597 Amount of pages postponed to be freed under memory pressure
1600 Amount of reclaimed lazyfree pages
1603 Number of pages swapped into memory and filled with zero, where I/O
1604 was optimized out because the page content was detected to be zero
1608 Number of zero-filled pages swapped out with I/O skipped due to the
1609 content being detected as zero.
1612 Number of pages moved in to memory from zswap.
1615 Number of pages moved out of memory to zswap.
1618 Number of pages written from zswap to swap.
1620 thp_fault_alloc (npn)
1621 Number of transparent hugepages which were allocated to satisfy
1622 a page fault. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE
1625 thp_collapse_alloc (npn)
1626 Number of transparent hugepages which were allocated to allow
1627 collapsing an existing range of pages. This counter is not
1628 present when CONFIG_TRANSPARENT_HUGEPAGE is not set.
1631 Number of transparent hugepages which are swapout in one piece
1634 thp_swpout_fallback (npn)
1635 Number of transparent hugepages which were split before swapout.
1636 Usually because failed to allocate some continuous swap space
1639 numa_pages_migrated (npn)
1640 Number of pages migrated by NUMA balancing.
1642 numa_pte_updates (npn)
1643 Number of pages whose page table entries are modified by
1644 NUMA balancing to produce NUMA hinting faults on access.
1646 numa_hint_faults (npn)
1647 Number of NUMA hinting faults.
1650 Number of pages demoted by kswapd.
1653 Number of pages demoted directly.
1656 Number of pages demoted by khugepaged.
1659 Amount of memory used by hugetlb pages. This metric only shows
1660 up if hugetlb usage is accounted for in memory.current (i.e.
1661 cgroup is mounted with the memory_hugetlb_accounting option).
1664 A read-only nested-keyed file which exists on non-root cgroups.
1666 This breaks down the cgroup's memory footprint into different
1667 types of memory, type-specific details, and other information
1668 per node on the state of the memory management system.
1670 This is useful for providing visibility into the NUMA locality
1671 information within an memcg since the pages are allowed to be
1672 allocated from any physical node. One of the use case is evaluating
1673 application performance by combining this information with the
1674 application's CPU allocation.
1676 All memory amounts are in bytes.
1678 The output format of memory.numa_stat is::
1680 type N0=<bytes in node 0> N1=<bytes in node 1> ...
1682 The entries are ordered to be human readable, and new entries
1683 can show up in the middle. Don't rely on items remaining in a
1684 fixed position; use the keys to look up specific values!
1686 The entries can refer to the memory.stat.
1689 A read-only single value file which exists on non-root
1692 The total amount of swap currently being used by the cgroup
1693 and its descendants.
1696 A read-write single value file which exists on non-root
1697 cgroups. The default is "max".
1699 Swap usage throttle limit. If a cgroup's swap usage exceeds
1700 this limit, all its further allocations will be throttled to
1701 allow userspace to implement custom out-of-memory procedures.
1703 This limit marks a point of no return for the cgroup. It is NOT
1704 designed to manage the amount of swapping a workload does
1705 during regular operation. Compare to memory.swap.max, which
1706 prohibits swapping past a set amount, but lets the cgroup
1707 continue unimpeded as long as other memory can be reclaimed.
1709 Healthy workloads are not expected to reach this limit.
1712 A read-write single value file which exists on non-root cgroups.
1714 The max swap usage recorded for the cgroup and its descendants since
1715 the creation of the cgroup or the most recent reset for that FD.
1717 A write of any non-empty string to this file resets it to the
1718 current memory usage for subsequent reads through the same
1722 A read-write single value file which exists on non-root
1723 cgroups. The default is "max".
1725 Swap usage hard limit. If a cgroup's swap usage reaches this
1726 limit, anonymous memory of the cgroup will not be swapped out.
1729 A read-only flat-keyed file which exists on non-root cgroups.
1730 The following entries are defined. Unless specified
1731 otherwise, a value change in this file generates a file
1735 The number of times the cgroup's swap usage was over
1739 The number of times the cgroup's swap usage was about
1740 to go over the max boundary and swap allocation
1744 The number of times swap allocation failed either
1745 because of running out of swap system-wide or max
1748 When reduced under the current usage, the existing swap
1749 entries are reclaimed gradually and the swap usage may stay
1750 higher than the limit for an extended period of time. This
1751 reduces the impact on the workload and memory management.
1753 memory.zswap.current
1754 A read-only single value file which exists on non-root
1757 The total amount of memory consumed by the zswap compression
1761 A read-write single value file which exists on non-root
1762 cgroups. The default is "max".
1764 Zswap usage hard limit. If a cgroup's zswap pool reaches this
1765 limit, it will refuse to take any more stores before existing
1766 entries fault back in or are written out to disk.
1768 memory.zswap.writeback
1769 A read-write single value file. The default value is "1".
1770 Note that this setting is hierarchical, i.e. the writeback would be
1771 implicitly disabled for child cgroups if the upper hierarchy
1774 When this is set to 0, all swapping attempts to swapping devices
1775 are disabled. This included both zswap writebacks, and swapping due
1776 to zswap store failures. If the zswap store failures are recurring
1777 (for e.g if the pages are incompressible), users can observe
1778 reclaim inefficiency after disabling writeback (because the same
1779 pages might be rejected again and again).
1781 Note that this is subtly different from setting memory.swap.max to
1782 0, as it still allows for pages to be written to the zswap pool.
1783 This setting has no effect if zswap is disabled, and swapping
1784 is allowed unless memory.swap.max is set to 0.
1787 A read-only nested-keyed file.
1789 Shows pressure stall information for memory. See
1790 :ref:`Documentation/accounting/psi.rst <psi>` for details.
1796 "memory.high" is the main mechanism to control memory usage.
1797 Over-committing on high limit (sum of high limits > available memory)
1798 and letting global memory pressure to distribute memory according to
1799 usage is a viable strategy.
1801 Because breach of the high limit doesn't trigger the OOM killer but
1802 throttles the offending cgroup, a management agent has ample
1803 opportunities to monitor and take appropriate actions such as granting
1804 more memory or terminating the workload.
1806 Determining whether a cgroup has enough memory is not trivial as
1807 memory usage doesn't indicate whether the workload can benefit from
1808 more memory. For example, a workload which writes data received from
1809 network to a file can use all available memory but can also operate as
1810 performant with a small amount of memory. A measure of memory
1811 pressure - how much the workload is being impacted due to lack of
1812 memory - is necessary to determine whether a workload needs more
1813 memory; unfortunately, memory pressure monitoring mechanism isn't
1820 A memory area is charged to the cgroup which instantiated it and stays
1821 charged to the cgroup until the area is released. Migrating a process
1822 to a different cgroup doesn't move the memory usages that it
1823 instantiated while in the previous cgroup to the new cgroup.
1825 A memory area may be used by processes belonging to different cgroups.
1826 To which cgroup the area will be charged is in-deterministic; however,
1827 over time, the memory area is likely to end up in a cgroup which has
1828 enough memory allowance to avoid high reclaim pressure.
1830 If a cgroup sweeps a considerable amount of memory which is expected
1831 to be accessed repeatedly by other cgroups, it may make sense to use
1832 POSIX_FADV_DONTNEED to relinquish the ownership of memory areas
1833 belonging to the affected files to ensure correct memory ownership.
1839 The "io" controller regulates the distribution of IO resources. This
1840 controller implements both weight based and absolute bandwidth or IOPS
1841 limit distribution; however, weight based distribution is available
1842 only if cfq-iosched is in use and neither scheme is available for
1850 A read-only nested-keyed file.
1852 Lines are keyed by $MAJ:$MIN device numbers and not ordered.
1853 The following nested keys are defined.
1855 ====== =====================
1857 wbytes Bytes written
1858 rios Number of read IOs
1859 wios Number of write IOs
1860 dbytes Bytes discarded
1861 dios Number of discard IOs
1862 ====== =====================
1864 An example read output follows::
1866 8:16 rbytes=1459200 wbytes=314773504 rios=192 wios=353 dbytes=0 dios=0
1867 8:0 rbytes=90430464 wbytes=299008000 rios=8950 wios=1252 dbytes=50331648 dios=3021
1870 A read-write nested-keyed file which exists only on the root
1873 This file configures the Quality of Service of the IO cost
1874 model based controller (CONFIG_BLK_CGROUP_IOCOST) which
1875 currently implements "io.weight" proportional control. Lines
1876 are keyed by $MAJ:$MIN device numbers and not ordered. The
1877 line for a given device is populated on the first write for
1878 the device on "io.cost.qos" or "io.cost.model". The following
1879 nested keys are defined.
1881 ====== =====================================
1882 enable Weight-based control enable
1883 ctrl "auto" or "user"
1884 rpct Read latency percentile [0, 100]
1885 rlat Read latency threshold
1886 wpct Write latency percentile [0, 100]
1887 wlat Write latency threshold
1888 min Minimum scaling percentage [1, 10000]
1889 max Maximum scaling percentage [1, 10000]
1890 ====== =====================================
1892 The controller is disabled by default and can be enabled by
1893 setting "enable" to 1. "rpct" and "wpct" parameters default
1894 to zero and the controller uses internal device saturation
1895 state to adjust the overall IO rate between "min" and "max".
1897 When a better control quality is needed, latency QoS
1898 parameters can be configured. For example::
1900 8:16 enable=1 ctrl=auto rpct=95.00 rlat=75000 wpct=95.00 wlat=150000 min=50.00 max=150.0
1902 shows that on sdb, the controller is enabled, will consider
1903 the device saturated if the 95th percentile of read completion
1904 latencies is above 75ms or write 150ms, and adjust the overall
1905 IO issue rate between 50% and 150% accordingly.
1907 The lower the saturation point, the better the latency QoS at
1908 the cost of aggregate bandwidth. The narrower the allowed
1909 adjustment range between "min" and "max", the more conformant
1910 to the cost model the IO behavior. Note that the IO issue
1911 base rate may be far off from 100% and setting "min" and "max"
1912 blindly can lead to a significant loss of device capacity or
1913 control quality. "min" and "max" are useful for regulating
1914 devices which show wide temporary behavior changes - e.g. a
1915 ssd which accepts writes at the line speed for a while and
1916 then completely stalls for multiple seconds.
1918 When "ctrl" is "auto", the parameters are controlled by the
1919 kernel and may change automatically. Setting "ctrl" to "user"
1920 or setting any of the percentile and latency parameters puts
1921 it into "user" mode and disables the automatic changes. The
1922 automatic mode can be restored by setting "ctrl" to "auto".
1925 A read-write nested-keyed file which exists only on the root
1928 This file configures the cost model of the IO cost model based
1929 controller (CONFIG_BLK_CGROUP_IOCOST) which currently
1930 implements "io.weight" proportional control. Lines are keyed
1931 by $MAJ:$MIN device numbers and not ordered. The line for a
1932 given device is populated on the first write for the device on
1933 "io.cost.qos" or "io.cost.model". The following nested keys
1936 ===== ================================
1937 ctrl "auto" or "user"
1938 model The cost model in use - "linear"
1939 ===== ================================
1941 When "ctrl" is "auto", the kernel may change all parameters
1942 dynamically. When "ctrl" is set to "user" or any other
1943 parameters are written to, "ctrl" become "user" and the
1944 automatic changes are disabled.
1946 When "model" is "linear", the following model parameters are
1949 ============= ========================================
1950 [r|w]bps The maximum sequential IO throughput
1951 [r|w]seqiops The maximum 4k sequential IOs per second
1952 [r|w]randiops The maximum 4k random IOs per second
1953 ============= ========================================
1955 From the above, the builtin linear model determines the base
1956 costs of a sequential and random IO and the cost coefficient
1957 for the IO size. While simple, this model can cover most
1958 common device classes acceptably.
1960 The IO cost model isn't expected to be accurate in absolute
1961 sense and is scaled to the device behavior dynamically.
1963 If needed, tools/cgroup/iocost_coef_gen.py can be used to
1964 generate device-specific coefficients.
1967 A read-write flat-keyed file which exists on non-root cgroups.
1968 The default is "default 100".
1970 The first line is the default weight applied to devices
1971 without specific override. The rest are overrides keyed by
1972 $MAJ:$MIN device numbers and not ordered. The weights are in
1973 the range [1, 10000] and specifies the relative amount IO time
1974 the cgroup can use in relation to its siblings.
1976 The default weight can be updated by writing either "default
1977 $WEIGHT" or simply "$WEIGHT". Overrides can be set by writing
1978 "$MAJ:$MIN $WEIGHT" and unset by writing "$MAJ:$MIN default".
1980 An example read output follows::
1987 A read-write nested-keyed file which exists on non-root
1990 BPS and IOPS based IO limit. Lines are keyed by $MAJ:$MIN
1991 device numbers and not ordered. The following nested keys are
1994 ===== ==================================
1995 rbps Max read bytes per second
1996 wbps Max write bytes per second
1997 riops Max read IO operations per second
1998 wiops Max write IO operations per second
1999 ===== ==================================
2001 When writing, any number of nested key-value pairs can be
2002 specified in any order. "max" can be specified as the value
2003 to remove a specific limit. If the same key is specified
2004 multiple times, the outcome is undefined.
2006 BPS and IOPS are measured in each IO direction and IOs are
2007 delayed if limit is reached. Temporary bursts are allowed.
2009 Setting read limit at 2M BPS and write at 120 IOPS for 8:16::
2011 echo "8:16 rbps=2097152 wiops=120" > io.max
2013 Reading returns the following::
2015 8:16 rbps=2097152 wbps=max riops=max wiops=120
2017 Write IOPS limit can be removed by writing the following::
2019 echo "8:16 wiops=max" > io.max
2021 Reading now returns the following::
2023 8:16 rbps=2097152 wbps=max riops=max wiops=max
2026 A read-only nested-keyed file.
2028 Shows pressure stall information for IO. See
2029 :ref:`Documentation/accounting/psi.rst <psi>` for details.
2035 Page cache is dirtied through buffered writes and shared mmaps and
2036 written asynchronously to the backing filesystem by the writeback
2037 mechanism. Writeback sits between the memory and IO domains and
2038 regulates the proportion of dirty memory by balancing dirtying and
2041 The io controller, in conjunction with the memory controller,
2042 implements control of page cache writeback IOs. The memory controller
2043 defines the memory domain that dirty memory ratio is calculated and
2044 maintained for and the io controller defines the io domain which
2045 writes out dirty pages for the memory domain. Both system-wide and
2046 per-cgroup dirty memory states are examined and the more restrictive
2047 of the two is enforced.
2049 cgroup writeback requires explicit support from the underlying
2050 filesystem. Currently, cgroup writeback is implemented on ext2, ext4,
2051 btrfs, f2fs, and xfs. On other filesystems, all writeback IOs are
2052 attributed to the root cgroup.
2054 There are inherent differences in memory and writeback management
2055 which affects how cgroup ownership is tracked. Memory is tracked per
2056 page while writeback per inode. For the purpose of writeback, an
2057 inode is assigned to a cgroup and all IO requests to write dirty pages
2058 from the inode are attributed to that cgroup.
2060 As cgroup ownership for memory is tracked per page, there can be pages
2061 which are associated with different cgroups than the one the inode is
2062 associated with. These are called foreign pages. The writeback
2063 constantly keeps track of foreign pages and, if a particular foreign
2064 cgroup becomes the majority over a certain period of time, switches
2065 the ownership of the inode to that cgroup.
2067 While this model is enough for most use cases where a given inode is
2068 mostly dirtied by a single cgroup even when the main writing cgroup
2069 changes over time, use cases where multiple cgroups write to a single
2070 inode simultaneously are not supported well. In such circumstances, a
2071 significant portion of IOs are likely to be attributed incorrectly.
2072 As memory controller assigns page ownership on the first use and
2073 doesn't update it until the page is released, even if writeback
2074 strictly follows page ownership, multiple cgroups dirtying overlapping
2075 areas wouldn't work as expected. It's recommended to avoid such usage
2078 The sysctl knobs which affect writeback behavior are applied to cgroup
2079 writeback as follows.
2081 vm.dirty_background_ratio, vm.dirty_ratio
2082 These ratios apply the same to cgroup writeback with the
2083 amount of available memory capped by limits imposed by the
2084 memory controller and system-wide clean memory.
2086 vm.dirty_background_bytes, vm.dirty_bytes
2087 For cgroup writeback, this is calculated into ratio against
2088 total available memory and applied the same way as
2089 vm.dirty[_background]_ratio.
2095 This is a cgroup v2 controller for IO workload protection. You provide a group
2096 with a latency target, and if the average latency exceeds that target the
2097 controller will throttle any peers that have a lower latency target than the
2100 The limits are only applied at the peer level in the hierarchy. This means that
2101 in the diagram below, only groups A, B, and C will influence each other, and
2102 groups D and F will influence each other. Group G will influence nobody::
2111 So the ideal way to configure this is to set io.latency in groups A, B, and C.
2112 Generally you do not want to set a value lower than the latency your device
2113 supports. Experiment to find the value that works best for your workload.
2114 Start at higher than the expected latency for your device and watch the
2115 avg_lat value in io.stat for your workload group to get an idea of the
2116 latency you see during normal operation. Use the avg_lat value as a basis for
2117 your real setting, setting at 10-15% higher than the value in io.stat.
2119 How IO Latency Throttling Works
2120 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2122 io.latency is work conserving; so as long as everybody is meeting their latency
2123 target the controller doesn't do anything. Once a group starts missing its
2124 target it begins throttling any peer group that has a higher target than itself.
2125 This throttling takes 2 forms:
2127 - Queue depth throttling. This is the number of outstanding IO's a group is
2128 allowed to have. We will clamp down relatively quickly, starting at no limit
2129 and going all the way down to 1 IO at a time.
2131 - Artificial delay induction. There are certain types of IO that cannot be
2132 throttled without possibly adversely affecting higher priority groups. This
2133 includes swapping and metadata IO. These types of IO are allowed to occur
2134 normally, however they are "charged" to the originating group. If the
2135 originating group is being throttled you will see the use_delay and delay
2136 fields in io.stat increase. The delay value is how many microseconds that are
2137 being added to any process that runs in this group. Because this number can
2138 grow quite large if there is a lot of swapping or metadata IO occurring we
2139 limit the individual delay events to 1 second at a time.
2141 Once the victimized group starts meeting its latency target again it will start
2142 unthrottling any peer groups that were throttled previously. If the victimized
2143 group simply stops doing IO the global counter will unthrottle appropriately.
2145 IO Latency Interface Files
2146 ~~~~~~~~~~~~~~~~~~~~~~~~~~
2149 This takes a similar format as the other controllers.
2151 "MAJOR:MINOR target=<target time in microseconds>"
2154 If the controller is enabled you will see extra stats in io.stat in
2155 addition to the normal ones.
2158 This is the current queue depth for the group.
2161 This is an exponential moving average with a decay rate of 1/exp
2162 bound by the sampling interval. The decay rate interval can be
2163 calculated by multiplying the win value in io.stat by the
2164 corresponding number of samples based on the win value.
2167 The sampling window size in milliseconds. This is the minimum
2168 duration of time between evaluation events. Windows only elapse
2169 with IO activity. Idle periods extend the most recent window.
2174 A single attribute controls the behavior of the I/O priority cgroup policy,
2175 namely the io.prio.class attribute. The following values are accepted for
2179 Do not modify the I/O priority class.
2182 For requests that have a non-RT I/O priority class, change it into RT.
2183 Also change the priority level of these requests to 4. Do not modify
2184 the I/O priority of requests that have priority class RT.
2187 For requests that do not have an I/O priority class or that have I/O
2188 priority class RT, change it into BE. Also change the priority level
2189 of these requests to 0. Do not modify the I/O priority class of
2190 requests that have priority class IDLE.
2193 Change the I/O priority class of all requests into IDLE, the lowest
2197 Deprecated. Just an alias for promote-to-rt.
2199 The following numerical values are associated with the I/O priority policies:
2201 +----------------+---+
2203 +----------------+---+
2204 | promote-to-rt | 1 |
2205 +----------------+---+
2206 | restrict-to-be | 2 |
2207 +----------------+---+
2209 +----------------+---+
2211 The numerical value that corresponds to each I/O priority class is as follows:
2213 +-------------------------------+---+
2214 | IOPRIO_CLASS_NONE | 0 |
2215 +-------------------------------+---+
2216 | IOPRIO_CLASS_RT (real-time) | 1 |
2217 +-------------------------------+---+
2218 | IOPRIO_CLASS_BE (best effort) | 2 |
2219 +-------------------------------+---+
2220 | IOPRIO_CLASS_IDLE | 3 |
2221 +-------------------------------+---+
2223 The algorithm to set the I/O priority class for a request is as follows:
2225 - If I/O priority class policy is promote-to-rt, change the request I/O
2226 priority class to IOPRIO_CLASS_RT and change the request I/O priority
2228 - If I/O priority class policy is not promote-to-rt, translate the I/O priority
2229 class policy into a number, then change the request I/O priority class
2230 into the maximum of the I/O priority class policy number and the numerical
2236 The process number controller is used to allow a cgroup to stop any
2237 new tasks from being fork()'d or clone()'d after a specified limit is
2240 The number of tasks in a cgroup can be exhausted in ways which other
2241 controllers cannot prevent, thus warranting its own controller. For
2242 example, a fork bomb is likely to exhaust the number of tasks before
2243 hitting memory restrictions.
2245 Note that PIDs used in this controller refer to TIDs, process IDs as
2253 A read-write single value file which exists on non-root
2254 cgroups. The default is "max".
2256 Hard limit of number of processes.
2259 A read-only single value file which exists on non-root cgroups.
2261 The number of processes currently in the cgroup and its
2265 A read-only single value file which exists on non-root cgroups.
2267 The maximum value that the number of processes in the cgroup and its
2268 descendants has ever reached.
2271 A read-only flat-keyed file which exists on non-root cgroups. Unless
2272 specified otherwise, a value change in this file generates a file
2273 modified event. The following entries are defined.
2276 The number of times the cgroup's total number of processes hit the pids.max
2277 limit (see also pids_localevents).
2280 Similar to pids.events but the fields in the file are local
2281 to the cgroup i.e. not hierarchical. The file modified event
2282 generated on this file reflects only the local events.
2284 Organisational operations are not blocked by cgroup policies, so it is
2285 possible to have pids.current > pids.max. This can be done by either
2286 setting the limit to be smaller than pids.current, or attaching enough
2287 processes to the cgroup such that pids.current is larger than
2288 pids.max. However, it is not possible to violate a cgroup PID policy
2289 through fork() or clone(). These will return -EAGAIN if the creation
2290 of a new process would cause a cgroup policy to be violated.
2296 The "cpuset" controller provides a mechanism for constraining
2297 the CPU and memory node placement of tasks to only the resources
2298 specified in the cpuset interface files in a task's current cgroup.
2299 This is especially valuable on large NUMA systems where placing jobs
2300 on properly sized subsets of the systems with careful processor and
2301 memory placement to reduce cross-node memory access and contention
2302 can improve overall system performance.
2304 The "cpuset" controller is hierarchical. That means the controller
2305 cannot use CPUs or memory nodes not allowed in its parent.
2308 Cpuset Interface Files
2309 ~~~~~~~~~~~~~~~~~~~~~~
2312 A read-write multiple values file which exists on non-root
2313 cpuset-enabled cgroups.
2315 It lists the requested CPUs to be used by tasks within this
2316 cgroup. The actual list of CPUs to be granted, however, is
2317 subjected to constraints imposed by its parent and can differ
2318 from the requested CPUs.
2320 The CPU numbers are comma-separated numbers or ranges.
2326 An empty value indicates that the cgroup is using the same
2327 setting as the nearest cgroup ancestor with a non-empty
2328 "cpuset.cpus" or all the available CPUs if none is found.
2330 The value of "cpuset.cpus" stays constant until the next update
2331 and won't be affected by any CPU hotplug events.
2333 cpuset.cpus.effective
2334 A read-only multiple values file which exists on all
2335 cpuset-enabled cgroups.
2337 It lists the onlined CPUs that are actually granted to this
2338 cgroup by its parent. These CPUs are allowed to be used by
2339 tasks within the current cgroup.
2341 If "cpuset.cpus" is empty, the "cpuset.cpus.effective" file shows
2342 all the CPUs from the parent cgroup that can be available to
2343 be used by this cgroup. Otherwise, it should be a subset of
2344 "cpuset.cpus" unless none of the CPUs listed in "cpuset.cpus"
2345 can be granted. In this case, it will be treated just like an
2346 empty "cpuset.cpus".
2348 Its value will be affected by CPU hotplug events.
2351 A read-write multiple values file which exists on non-root
2352 cpuset-enabled cgroups.
2354 It lists the requested memory nodes to be used by tasks within
2355 this cgroup. The actual list of memory nodes granted, however,
2356 is subjected to constraints imposed by its parent and can differ
2357 from the requested memory nodes.
2359 The memory node numbers are comma-separated numbers or ranges.
2365 An empty value indicates that the cgroup is using the same
2366 setting as the nearest cgroup ancestor with a non-empty
2367 "cpuset.mems" or all the available memory nodes if none
2370 The value of "cpuset.mems" stays constant until the next update
2371 and won't be affected by any memory nodes hotplug events.
2373 Setting a non-empty value to "cpuset.mems" causes memory of
2374 tasks within the cgroup to be migrated to the designated nodes if
2375 they are currently using memory outside of the designated nodes.
2377 There is a cost for this memory migration. The migration
2378 may not be complete and some memory pages may be left behind.
2379 So it is recommended that "cpuset.mems" should be set properly
2380 before spawning new tasks into the cpuset. Even if there is
2381 a need to change "cpuset.mems" with active tasks, it shouldn't
2384 cpuset.mems.effective
2385 A read-only multiple values file which exists on all
2386 cpuset-enabled cgroups.
2388 It lists the onlined memory nodes that are actually granted to
2389 this cgroup by its parent. These memory nodes are allowed to
2390 be used by tasks within the current cgroup.
2392 If "cpuset.mems" is empty, it shows all the memory nodes from the
2393 parent cgroup that will be available to be used by this cgroup.
2394 Otherwise, it should be a subset of "cpuset.mems" unless none of
2395 the memory nodes listed in "cpuset.mems" can be granted. In this
2396 case, it will be treated just like an empty "cpuset.mems".
2398 Its value will be affected by memory nodes hotplug events.
2400 cpuset.cpus.exclusive
2401 A read-write multiple values file which exists on non-root
2402 cpuset-enabled cgroups.
2404 It lists all the exclusive CPUs that are allowed to be used
2405 to create a new cpuset partition. Its value is not used
2406 unless the cgroup becomes a valid partition root. See the
2407 "cpuset.cpus.partition" section below for a description of what
2408 a cpuset partition is.
2410 When the cgroup becomes a partition root, the actual exclusive
2411 CPUs that are allocated to that partition are listed in
2412 "cpuset.cpus.exclusive.effective" which may be different
2413 from "cpuset.cpus.exclusive". If "cpuset.cpus.exclusive"
2414 has previously been set, "cpuset.cpus.exclusive.effective"
2415 is always a subset of it.
2417 Users can manually set it to a value that is different from
2418 "cpuset.cpus". One constraint in setting it is that the list of
2419 CPUs must be exclusive with respect to "cpuset.cpus.exclusive"
2420 of its sibling. If "cpuset.cpus.exclusive" of a sibling cgroup
2421 isn't set, its "cpuset.cpus" value, if set, cannot be a subset
2422 of it to leave at least one CPU available when the exclusive
2423 CPUs are taken away.
2425 For a parent cgroup, any one of its exclusive CPUs can only
2426 be distributed to at most one of its child cgroups. Having an
2427 exclusive CPU appearing in two or more of its child cgroups is
2428 not allowed (the exclusivity rule). A value that violates the
2429 exclusivity rule will be rejected with a write error.
2431 The root cgroup is a partition root and all its available CPUs
2432 are in its exclusive CPU set.
2434 cpuset.cpus.exclusive.effective
2435 A read-only multiple values file which exists on all non-root
2436 cpuset-enabled cgroups.
2438 This file shows the effective set of exclusive CPUs that
2439 can be used to create a partition root. The content
2440 of this file will always be a subset of its parent's
2441 "cpuset.cpus.exclusive.effective" if its parent is not the root
2442 cgroup. It will also be a subset of "cpuset.cpus.exclusive"
2443 if it is set. If "cpuset.cpus.exclusive" is not set, it is
2444 treated to have an implicit value of "cpuset.cpus" in the
2445 formation of local partition.
2447 cpuset.cpus.isolated
2448 A read-only and root cgroup only multiple values file.
2450 This file shows the set of all isolated CPUs used in existing
2451 isolated partitions. It will be empty if no isolated partition
2454 cpuset.cpus.partition
2455 A read-write single value file which exists on non-root
2456 cpuset-enabled cgroups. This flag is owned by the parent cgroup
2457 and is not delegatable.
2459 It accepts only the following input values when written to.
2461 ========== =====================================
2462 "member" Non-root member of a partition
2463 "root" Partition root
2464 "isolated" Partition root without load balancing
2465 ========== =====================================
2467 A cpuset partition is a collection of cpuset-enabled cgroups with
2468 a partition root at the top of the hierarchy and its descendants
2469 except those that are separate partition roots themselves and
2470 their descendants. A partition has exclusive access to the
2471 set of exclusive CPUs allocated to it. Other cgroups outside
2472 of that partition cannot use any CPUs in that set.
2474 There are two types of partitions - local and remote. A local
2475 partition is one whose parent cgroup is also a valid partition
2476 root. A remote partition is one whose parent cgroup is not a
2477 valid partition root itself. Writing to "cpuset.cpus.exclusive"
2478 is optional for the creation of a local partition as its
2479 "cpuset.cpus.exclusive" file will assume an implicit value that
2480 is the same as "cpuset.cpus" if it is not set. Writing the
2481 proper "cpuset.cpus.exclusive" values down the cgroup hierarchy
2482 before the target partition root is mandatory for the creation
2483 of a remote partition.
2485 Currently, a remote partition cannot be created under a local
2486 partition. All the ancestors of a remote partition root except
2487 the root cgroup cannot be a partition root.
2489 The root cgroup is always a partition root and its state cannot
2490 be changed. All other non-root cgroups start out as "member".
2492 When set to "root", the current cgroup is the root of a new
2493 partition or scheduling domain. The set of exclusive CPUs is
2494 determined by the value of its "cpuset.cpus.exclusive.effective".
2496 When set to "isolated", the CPUs in that partition will be in
2497 an isolated state without any load balancing from the scheduler
2498 and excluded from the unbound workqueues. Tasks placed in such
2499 a partition with multiple CPUs should be carefully distributed
2500 and bound to each of the individual CPUs for optimal performance.
2502 A partition root ("root" or "isolated") can be in one of the
2503 two possible states - valid or invalid. An invalid partition
2504 root is in a degraded state where some state information may
2505 be retained, but behaves more like a "member".
2507 All possible state transitions among "member", "root" and
2508 "isolated" are allowed.
2510 On read, the "cpuset.cpus.partition" file can show the following
2513 ============================= =====================================
2514 "member" Non-root member of a partition
2515 "root" Partition root
2516 "isolated" Partition root without load balancing
2517 "root invalid (<reason>)" Invalid partition root
2518 "isolated invalid (<reason>)" Invalid isolated partition root
2519 ============================= =====================================
2521 In the case of an invalid partition root, a descriptive string on
2522 why the partition is invalid is included within parentheses.
2524 For a local partition root to be valid, the following conditions
2527 1) The parent cgroup is a valid partition root.
2528 2) The "cpuset.cpus.exclusive.effective" file cannot be empty,
2529 though it may contain offline CPUs.
2530 3) The "cpuset.cpus.effective" cannot be empty unless there is
2531 no task associated with this partition.
2533 For a remote partition root to be valid, all the above conditions
2534 except the first one must be met.
2536 External events like hotplug or changes to "cpuset.cpus" or
2537 "cpuset.cpus.exclusive" can cause a valid partition root to
2538 become invalid and vice versa. Note that a task cannot be
2539 moved to a cgroup with empty "cpuset.cpus.effective".
2541 A valid non-root parent partition may distribute out all its CPUs
2542 to its child local partitions when there is no task associated
2545 Care must be taken to change a valid partition root to "member"
2546 as all its child local partitions, if present, will become
2547 invalid causing disruption to tasks running in those child
2548 partitions. These inactivated partitions could be recovered if
2549 their parent is switched back to a partition root with a proper
2550 value in "cpuset.cpus" or "cpuset.cpus.exclusive".
2552 Poll and inotify events are triggered whenever the state of
2553 "cpuset.cpus.partition" changes. That includes changes caused
2554 by write to "cpuset.cpus.partition", cpu hotplug or other
2555 changes that modify the validity status of the partition.
2556 This will allow user space agents to monitor unexpected changes
2557 to "cpuset.cpus.partition" without the need to do continuous
2560 A user can pre-configure certain CPUs to an isolated state
2561 with load balancing disabled at boot time with the "isolcpus"
2562 kernel boot command line option. If those CPUs are to be put
2563 into a partition, they have to be used in an isolated partition.
2569 Device controller manages access to device files. It includes both
2570 creation of new device files (using mknod), and access to the
2571 existing device files.
2573 Cgroup v2 device controller has no interface files and is implemented
2574 on top of cgroup BPF. To control access to device files, a user may
2575 create bpf programs of type BPF_PROG_TYPE_CGROUP_DEVICE and attach
2576 them to cgroups with BPF_CGROUP_DEVICE flag. On an attempt to access a
2577 device file, corresponding BPF programs will be executed, and depending
2578 on the return value the attempt will succeed or fail with -EPERM.
2580 A BPF_PROG_TYPE_CGROUP_DEVICE program takes a pointer to the
2581 bpf_cgroup_dev_ctx structure, which describes the device access attempt:
2582 access type (mknod/read/write) and device (type, major and minor numbers).
2583 If the program returns 0, the attempt fails with -EPERM, otherwise it
2586 An example of BPF_PROG_TYPE_CGROUP_DEVICE program may be found in
2587 tools/testing/selftests/bpf/progs/dev_cgroup.c in the kernel source tree.
2593 The "rdma" controller regulates the distribution and accounting of
2596 RDMA Interface Files
2597 ~~~~~~~~~~~~~~~~~~~~
2600 A readwrite nested-keyed file that exists for all the cgroups
2601 except root that describes current configured resource limit
2602 for a RDMA/IB device.
2604 Lines are keyed by device name and are not ordered.
2605 Each line contains space separated resource name and its configured
2606 limit that can be distributed.
2608 The following nested keys are defined.
2610 ========== =============================
2611 hca_handle Maximum number of HCA Handles
2612 hca_object Maximum number of HCA Objects
2613 ========== =============================
2615 An example for mlx4 and ocrdma device follows::
2617 mlx4_0 hca_handle=2 hca_object=2000
2618 ocrdma1 hca_handle=3 hca_object=max
2621 A read-only file that describes current resource usage.
2622 It exists for all the cgroup except root.
2624 An example for mlx4 and ocrdma device follows::
2626 mlx4_0 hca_handle=1 hca_object=20
2627 ocrdma1 hca_handle=1 hca_object=23
2632 The HugeTLB controller allows to limit the HugeTLB usage per control group and
2633 enforces the controller limit during page fault.
2635 HugeTLB Interface Files
2636 ~~~~~~~~~~~~~~~~~~~~~~~
2638 hugetlb.<hugepagesize>.current
2639 Show current usage for "hugepagesize" hugetlb. It exists for all
2640 the cgroup except root.
2642 hugetlb.<hugepagesize>.max
2643 Set/show the hard limit of "hugepagesize" hugetlb usage.
2644 The default value is "max". It exists for all the cgroup except root.
2646 hugetlb.<hugepagesize>.events
2647 A read-only flat-keyed file which exists on non-root cgroups.
2650 The number of allocation failure due to HugeTLB limit
2652 hugetlb.<hugepagesize>.events.local
2653 Similar to hugetlb.<hugepagesize>.events but the fields in the file
2654 are local to the cgroup i.e. not hierarchical. The file modified event
2655 generated on this file reflects only the local events.
2657 hugetlb.<hugepagesize>.numa_stat
2658 Similar to memory.numa_stat, it shows the numa information of the
2659 hugetlb pages of <hugepagesize> in this cgroup. Only active in
2660 use hugetlb pages are included. The per-node values are in bytes.
2665 The Miscellaneous cgroup provides the resource limiting and tracking
2666 mechanism for the scalar resources which cannot be abstracted like the other
2667 cgroup resources. Controller is enabled by the CONFIG_CGROUP_MISC config
2670 A resource can be added to the controller via enum misc_res_type{} in the
2671 include/linux/misc_cgroup.h file and the corresponding name via misc_res_name[]
2672 in the kernel/cgroup/misc.c file. Provider of the resource must set its
2673 capacity prior to using the resource by calling misc_cg_set_capacity().
2675 Once a capacity is set then the resource usage can be updated using charge and
2676 uncharge APIs. All of the APIs to interact with misc controller are in
2677 include/linux/misc_cgroup.h.
2679 Misc Interface Files
2680 ~~~~~~~~~~~~~~~~~~~~
2682 Miscellaneous controller provides 3 interface files. If two misc resources (res_a and res_b) are registered then:
2685 A read-only flat-keyed file shown only in the root cgroup. It shows
2686 miscellaneous scalar resources available on the platform along with
2694 A read-only flat-keyed file shown in the all cgroups. It shows
2695 the current usage of the resources in the cgroup and its children.::
2702 A read-only flat-keyed file shown in all cgroups. It shows the
2703 historical maximum usage of the resources in the cgroup and its
2711 A read-write flat-keyed file shown in the non root cgroups. Allowed
2712 maximum usage of the resources in the cgroup and its children.::
2718 Limit can be set by::
2720 # echo res_a 1 > misc.max
2722 Limit can be set to max by::
2724 # echo res_a max > misc.max
2726 Limits can be set higher than the capacity value in the misc.capacity
2730 A read-only flat-keyed file which exists on non-root cgroups. The
2731 following entries are defined. Unless specified otherwise, a value
2732 change in this file generates a file modified event. All fields in
2733 this file are hierarchical.
2736 The number of times the cgroup's resource usage was
2737 about to go over the max boundary.
2740 Similar to misc.events but the fields in the file are local to the
2741 cgroup i.e. not hierarchical. The file modified event generated on
2742 this file reflects only the local events.
2744 Migration and Ownership
2745 ~~~~~~~~~~~~~~~~~~~~~~~
2747 A miscellaneous scalar resource is charged to the cgroup in which it is used
2748 first, and stays charged to that cgroup until that resource is freed. Migrating
2749 a process to a different cgroup does not move the charge to the destination
2750 cgroup where the process has moved.
2758 perf_event controller, if not mounted on a legacy hierarchy, is
2759 automatically enabled on the v2 hierarchy so that perf events can
2760 always be filtered by cgroup v2 path. The controller can still be
2761 moved to a legacy hierarchy after v2 hierarchy is populated.
2764 Non-normative information
2765 -------------------------
2767 This section contains information that isn't considered to be a part of
2768 the stable kernel API and so is subject to change.
2771 CPU controller root cgroup process behaviour
2772 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2774 When distributing CPU cycles in the root cgroup each thread in this
2775 cgroup is treated as if it was hosted in a separate child cgroup of the
2776 root cgroup. This child cgroup weight is dependent on its thread nice
2779 For details of this mapping see sched_prio_to_weight array in
2780 kernel/sched/core.c file (values from this array should be scaled
2781 appropriately so the neutral - nice 0 - value is 100 instead of 1024).
2784 IO controller root cgroup process behaviour
2785 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2787 Root cgroup processes are hosted in an implicit leaf child node.
2788 When distributing IO resources this implicit child node is taken into
2789 account as if it was a normal child cgroup of the root cgroup with a
2790 weight value of 200.
2799 cgroup namespace provides a mechanism to virtualize the view of the
2800 "/proc/$PID/cgroup" file and cgroup mounts. The CLONE_NEWCGROUP clone
2801 flag can be used with clone(2) and unshare(2) to create a new cgroup
2802 namespace. The process running inside the cgroup namespace will have
2803 its "/proc/$PID/cgroup" output restricted to cgroupns root. The
2804 cgroupns root is the cgroup of the process at the time of creation of
2805 the cgroup namespace.
2807 Without cgroup namespace, the "/proc/$PID/cgroup" file shows the
2808 complete path of the cgroup of a process. In a container setup where
2809 a set of cgroups and namespaces are intended to isolate processes the
2810 "/proc/$PID/cgroup" file may leak potential system level information
2811 to the isolated processes. For example::
2813 # cat /proc/self/cgroup
2814 0::/batchjobs/container_id1
2816 The path '/batchjobs/container_id1' can be considered as system-data
2817 and undesirable to expose to the isolated processes. cgroup namespace
2818 can be used to restrict visibility of this path. For example, before
2819 creating a cgroup namespace, one would see::
2821 # ls -l /proc/self/ns/cgroup
2822 lrwxrwxrwx 1 root root 0 2014-07-15 10:37 /proc/self/ns/cgroup -> cgroup:[4026531835]
2823 # cat /proc/self/cgroup
2824 0::/batchjobs/container_id1
2826 After unsharing a new namespace, the view changes::
2828 # ls -l /proc/self/ns/cgroup
2829 lrwxrwxrwx 1 root root 0 2014-07-15 10:35 /proc/self/ns/cgroup -> cgroup:[4026532183]
2830 # cat /proc/self/cgroup
2833 When some thread from a multi-threaded process unshares its cgroup
2834 namespace, the new cgroupns gets applied to the entire process (all
2835 the threads). This is natural for the v2 hierarchy; however, for the
2836 legacy hierarchies, this may be unexpected.
2838 A cgroup namespace is alive as long as there are processes inside or
2839 mounts pinning it. When the last usage goes away, the cgroup
2840 namespace is destroyed. The cgroupns root and the actual cgroups
2847 The 'cgroupns root' for a cgroup namespace is the cgroup in which the
2848 process calling unshare(2) is running. For example, if a process in
2849 /batchjobs/container_id1 cgroup calls unshare, cgroup
2850 /batchjobs/container_id1 becomes the cgroupns root. For the
2851 init_cgroup_ns, this is the real root ('/') cgroup.
2853 The cgroupns root cgroup does not change even if the namespace creator
2854 process later moves to a different cgroup::
2856 # ~/unshare -c # unshare cgroupns in some cgroup
2857 # cat /proc/self/cgroup
2860 # echo 0 > sub_cgrp_1/cgroup.procs
2861 # cat /proc/self/cgroup
2864 Each process gets its namespace-specific view of "/proc/$PID/cgroup"
2866 Processes running inside the cgroup namespace will be able to see
2867 cgroup paths (in /proc/self/cgroup) only inside their root cgroup.
2868 From within an unshared cgroupns::
2872 # echo 7353 > sub_cgrp_1/cgroup.procs
2873 # cat /proc/7353/cgroup
2876 From the initial cgroup namespace, the real cgroup path will be
2879 $ cat /proc/7353/cgroup
2880 0::/batchjobs/container_id1/sub_cgrp_1
2882 From a sibling cgroup namespace (that is, a namespace rooted at a
2883 different cgroup), the cgroup path relative to its own cgroup
2884 namespace root will be shown. For instance, if PID 7353's cgroup
2885 namespace root is at '/batchjobs/container_id2', then it will see::
2887 # cat /proc/7353/cgroup
2888 0::/../container_id2/sub_cgrp_1
2890 Note that the relative path always starts with '/' to indicate that
2891 its relative to the cgroup namespace root of the caller.
2894 Migration and setns(2)
2895 ----------------------
2897 Processes inside a cgroup namespace can move into and out of the
2898 namespace root if they have proper access to external cgroups. For
2899 example, from inside a namespace with cgroupns root at
2900 /batchjobs/container_id1, and assuming that the global hierarchy is
2901 still accessible inside cgroupns::
2903 # cat /proc/7353/cgroup
2905 # echo 7353 > batchjobs/container_id2/cgroup.procs
2906 # cat /proc/7353/cgroup
2907 0::/../container_id2
2909 Note that this kind of setup is not encouraged. A task inside cgroup
2910 namespace should only be exposed to its own cgroupns hierarchy.
2912 setns(2) to another cgroup namespace is allowed when:
2914 (a) the process has CAP_SYS_ADMIN against its current user namespace
2915 (b) the process has CAP_SYS_ADMIN against the target cgroup
2918 No implicit cgroup changes happen with attaching to another cgroup
2919 namespace. It is expected that the someone moves the attaching
2920 process under the target cgroup namespace root.
2923 Interaction with Other Namespaces
2924 ---------------------------------
2926 Namespace specific cgroup hierarchy can be mounted by a process
2927 running inside a non-init cgroup namespace::
2929 # mount -t cgroup2 none $MOUNT_POINT
2931 This will mount the unified cgroup hierarchy with cgroupns root as the
2932 filesystem root. The process needs CAP_SYS_ADMIN against its user and
2935 The virtualization of /proc/self/cgroup file combined with restricting
2936 the view of cgroup hierarchy by namespace-private cgroupfs mount
2937 provides a properly isolated cgroup view inside the container.
2940 Information on Kernel Programming
2941 =================================
2943 This section contains kernel programming information in the areas
2944 where interacting with cgroup is necessary. cgroup core and
2945 controllers are not covered.
2948 Filesystem Support for Writeback
2949 --------------------------------
2951 A filesystem can support cgroup writeback by updating
2952 address_space_operations->writepage[s]() to annotate bio's using the
2953 following two functions.
2955 wbc_init_bio(@wbc, @bio)
2956 Should be called for each bio carrying writeback data and
2957 associates the bio with the inode's owner cgroup and the
2958 corresponding request queue. This must be called after
2959 a queue (device) has been associated with the bio and
2962 wbc_account_cgroup_owner(@wbc, @folio, @bytes)
2963 Should be called for each data segment being written out.
2964 While this function doesn't care exactly when it's called
2965 during the writeback session, it's the easiest and most
2966 natural to call it as data segments are added to a bio.
2968 With writeback bio's annotated, cgroup support can be enabled per
2969 super_block by setting SB_I_CGROUPWB in ->s_iflags. This allows for
2970 selective disabling of cgroup writeback support which is helpful when
2971 certain filesystem features, e.g. journaled data mode, are
2974 wbc_init_bio() binds the specified bio to its cgroup. Depending on
2975 the configuration, the bio may be executed at a lower priority and if
2976 the writeback session is holding shared resources, e.g. a journal
2977 entry, may lead to priority inversion. There is no one easy solution
2978 for the problem. Filesystems can try to work around specific problem
2979 cases by skipping wbc_init_bio() and using bio_associate_blkg()
2983 Deprecated v1 Core Features
2984 ===========================
2986 - Multiple hierarchies including named ones are not supported.
2988 - All v1 mount options are not supported.
2990 - The "tasks" file is removed and "cgroup.procs" is not sorted.
2992 - "cgroup.clone_children" is removed.
2994 - /proc/cgroups is meaningless for v2. Use "cgroup.controllers" or
2995 "cgroup.stat" files at the root instead.
2998 Issues with v1 and Rationales for v2
2999 ====================================
3001 Multiple Hierarchies
3002 --------------------
3004 cgroup v1 allowed an arbitrary number of hierarchies and each
3005 hierarchy could host any number of controllers. While this seemed to
3006 provide a high level of flexibility, it wasn't useful in practice.
3008 For example, as there is only one instance of each controller, utility
3009 type controllers such as freezer which can be useful in all
3010 hierarchies could only be used in one. The issue is exacerbated by
3011 the fact that controllers couldn't be moved to another hierarchy once
3012 hierarchies were populated. Another issue was that all controllers
3013 bound to a hierarchy were forced to have exactly the same view of the
3014 hierarchy. It wasn't possible to vary the granularity depending on
3015 the specific controller.
3017 In practice, these issues heavily limited which controllers could be
3018 put on the same hierarchy and most configurations resorted to putting
3019 each controller on its own hierarchy. Only closely related ones, such
3020 as the cpu and cpuacct controllers, made sense to be put on the same
3021 hierarchy. This often meant that userland ended up managing multiple
3022 similar hierarchies repeating the same steps on each hierarchy
3023 whenever a hierarchy management operation was necessary.
3025 Furthermore, support for multiple hierarchies came at a steep cost.
3026 It greatly complicated cgroup core implementation but more importantly
3027 the support for multiple hierarchies restricted how cgroup could be
3028 used in general and what controllers was able to do.
3030 There was no limit on how many hierarchies there might be, which meant
3031 that a thread's cgroup membership couldn't be described in finite
3032 length. The key might contain any number of entries and was unlimited
3033 in length, which made it highly awkward to manipulate and led to
3034 addition of controllers which existed only to identify membership,
3035 which in turn exacerbated the original problem of proliferating number
3038 Also, as a controller couldn't have any expectation regarding the
3039 topologies of hierarchies other controllers might be on, each
3040 controller had to assume that all other controllers were attached to
3041 completely orthogonal hierarchies. This made it impossible, or at
3042 least very cumbersome, for controllers to cooperate with each other.
3044 In most use cases, putting controllers on hierarchies which are
3045 completely orthogonal to each other isn't necessary. What usually is
3046 called for is the ability to have differing levels of granularity
3047 depending on the specific controller. In other words, hierarchy may
3048 be collapsed from leaf towards root when viewed from specific
3049 controllers. For example, a given configuration might not care about
3050 how memory is distributed beyond a certain level while still wanting
3051 to control how CPU cycles are distributed.
3057 cgroup v1 allowed threads of a process to belong to different cgroups.
3058 This didn't make sense for some controllers and those controllers
3059 ended up implementing different ways to ignore such situations but
3060 much more importantly it blurred the line between API exposed to
3061 individual applications and system management interface.
3063 Generally, in-process knowledge is available only to the process
3064 itself; thus, unlike service-level organization of processes,
3065 categorizing threads of a process requires active participation from
3066 the application which owns the target process.
3068 cgroup v1 had an ambiguously defined delegation model which got abused
3069 in combination with thread granularity. cgroups were delegated to
3070 individual applications so that they can create and manage their own
3071 sub-hierarchies and control resource distributions along them. This
3072 effectively raised cgroup to the status of a syscall-like API exposed
3075 First of all, cgroup has a fundamentally inadequate interface to be
3076 exposed this way. For a process to access its own knobs, it has to
3077 extract the path on the target hierarchy from /proc/self/cgroup,
3078 construct the path by appending the name of the knob to the path, open
3079 and then read and/or write to it. This is not only extremely clunky
3080 and unusual but also inherently racy. There is no conventional way to
3081 define transaction across the required steps and nothing can guarantee
3082 that the process would actually be operating on its own sub-hierarchy.
3084 cgroup controllers implemented a number of knobs which would never be
3085 accepted as public APIs because they were just adding control knobs to
3086 system-management pseudo filesystem. cgroup ended up with interface
3087 knobs which were not properly abstracted or refined and directly
3088 revealed kernel internal details. These knobs got exposed to
3089 individual applications through the ill-defined delegation mechanism
3090 effectively abusing cgroup as a shortcut to implementing public APIs
3091 without going through the required scrutiny.
3093 This was painful for both userland and kernel. Userland ended up with
3094 misbehaving and poorly abstracted interfaces and kernel exposing and
3095 locked into constructs inadvertently.
3098 Competition Between Inner Nodes and Threads
3099 -------------------------------------------
3101 cgroup v1 allowed threads to be in any cgroups which created an
3102 interesting problem where threads belonging to a parent cgroup and its
3103 children cgroups competed for resources. This was nasty as two
3104 different types of entities competed and there was no obvious way to
3105 settle it. Different controllers did different things.
3107 The cpu controller considered threads and cgroups as equivalents and
3108 mapped nice levels to cgroup weights. This worked for some cases but
3109 fell flat when children wanted to be allocated specific ratios of CPU
3110 cycles and the number of internal threads fluctuated - the ratios
3111 constantly changed as the number of competing entities fluctuated.
3112 There also were other issues. The mapping from nice level to weight
3113 wasn't obvious or universal, and there were various other knobs which
3114 simply weren't available for threads.
3116 The io controller implicitly created a hidden leaf node for each
3117 cgroup to host the threads. The hidden leaf had its own copies of all
3118 the knobs with ``leaf_`` prefixed. While this allowed equivalent
3119 control over internal threads, it was with serious drawbacks. It
3120 always added an extra layer of nesting which wouldn't be necessary
3121 otherwise, made the interface messy and significantly complicated the
3124 The memory controller didn't have a way to control what happened
3125 between internal tasks and child cgroups and the behavior was not
3126 clearly defined. There were attempts to add ad-hoc behaviors and
3127 knobs to tailor the behavior to specific workloads which would have
3128 led to problems extremely difficult to resolve in the long term.
3130 Multiple controllers struggled with internal tasks and came up with
3131 different ways to deal with it; unfortunately, all the approaches were
3132 severely flawed and, furthermore, the widely different behaviors
3133 made cgroup as a whole highly inconsistent.
3135 This clearly is a problem which needs to be addressed from cgroup core
3139 Other Interface Issues
3140 ----------------------
3142 cgroup v1 grew without oversight and developed a large number of
3143 idiosyncrasies and inconsistencies. One issue on the cgroup core side
3144 was how an empty cgroup was notified - a userland helper binary was
3145 forked and executed for each event. The event delivery wasn't
3146 recursive or delegatable. The limitations of the mechanism also led
3147 to in-kernel event delivery filtering mechanism further complicating
3150 Controller interfaces were problematic too. An extreme example is
3151 controllers completely ignoring hierarchical organization and treating
3152 all cgroups as if they were all located directly under the root
3153 cgroup. Some controllers exposed a large amount of inconsistent
3154 implementation details to userland.
3156 There also was no consistency across controllers. When a new cgroup
3157 was created, some controllers defaulted to not imposing extra
3158 restrictions while others disallowed any resource usage until
3159 explicitly configured. Configuration knobs for the same type of
3160 control used widely differing naming schemes and formats. Statistics
3161 and information knobs were named arbitrarily and used different
3162 formats and units even in the same controller.
3164 cgroup v2 establishes common conventions where appropriate and updates
3165 controllers so that they expose minimal and consistent interfaces.
3168 Controller Issues and Remedies
3169 ------------------------------
3174 The original lower boundary, the soft limit, is defined as a limit
3175 that is per default unset. As a result, the set of cgroups that
3176 global reclaim prefers is opt-in, rather than opt-out. The costs for
3177 optimizing these mostly negative lookups are so high that the
3178 implementation, despite its enormous size, does not even provide the
3179 basic desirable behavior. First off, the soft limit has no
3180 hierarchical meaning. All configured groups are organized in a global
3181 rbtree and treated like equal peers, regardless where they are located
3182 in the hierarchy. This makes subtree delegation impossible. Second,
3183 the soft limit reclaim pass is so aggressive that it not just
3184 introduces high allocation latencies into the system, but also impacts
3185 system performance due to overreclaim, to the point where the feature
3186 becomes self-defeating.
3188 The memory.low boundary on the other hand is a top-down allocated
3189 reserve. A cgroup enjoys reclaim protection when it's within its
3190 effective low, which makes delegation of subtrees possible. It also
3191 enjoys having reclaim pressure proportional to its overage when
3192 above its effective low.
3194 The original high boundary, the hard limit, is defined as a strict
3195 limit that can not budge, even if the OOM killer has to be called.
3196 But this generally goes against the goal of making the most out of the
3197 available memory. The memory consumption of workloads varies during
3198 runtime, and that requires users to overcommit. But doing that with a
3199 strict upper limit requires either a fairly accurate prediction of the
3200 working set size or adding slack to the limit. Since working set size
3201 estimation is hard and error prone, and getting it wrong results in
3202 OOM kills, most users tend to err on the side of a looser limit and
3203 end up wasting precious resources.
3205 The memory.high boundary on the other hand can be set much more
3206 conservatively. When hit, it throttles allocations by forcing them
3207 into direct reclaim to work off the excess, but it never invokes the
3208 OOM killer. As a result, a high boundary that is chosen too
3209 aggressively will not terminate the processes, but instead it will
3210 lead to gradual performance degradation. The user can monitor this
3211 and make corrections until the minimal memory footprint that still
3212 gives acceptable performance is found.
3214 In extreme cases, with many concurrent allocations and a complete
3215 breakdown of reclaim progress within the group, the high boundary can
3216 be exceeded. But even then it's mostly better to satisfy the
3217 allocation from the slack available in other groups or the rest of the
3218 system than killing the group. Otherwise, memory.max is there to
3219 limit this type of spillover and ultimately contain buggy or even
3220 malicious applications.
3222 Setting the original memory.limit_in_bytes below the current usage was
3223 subject to a race condition, where concurrent charges could cause the
3224 limit setting to fail. memory.max on the other hand will first set the
3225 limit to prevent new charges, and then reclaim and OOM kill until the
3226 new limit is met - or the task writing to memory.max is killed.
3228 The combined memory+swap accounting and limiting is replaced by real
3229 control over swap space.
3231 The main argument for a combined memory+swap facility in the original
3232 cgroup design was that global or parental pressure would always be
3233 able to swap all anonymous memory of a child group, regardless of the
3234 child's own (possibly untrusted) configuration. However, untrusted
3235 groups can sabotage swapping by other means - such as referencing its
3236 anonymous memory in a tight loop - and an admin can not assume full
3237 swappability when overcommitting untrusted jobs.
3239 For trusted jobs, on the other hand, a combined counter is not an
3240 intuitive userspace interface, and it flies in the face of the idea
3241 that cgroup controllers should account and limit specific physical
3242 resources. Swap space is a resource like all others in the system,
3243 and that's why unified hierarchy allows distributing it separately.