| /Linux-v6.1/Documentation/admin-guide/cgroup-v1/ |
| D | freezer-subsystem.rst | 6 and stop sets of tasks in order to schedule the resources of a machine
9 whole. The cgroup freezer uses cgroups to describe the set of tasks to
11 a means to start and stop the tasks composing the job.
14 of tasks. The freezer allows the checkpoint code to obtain a consistent
15 image of the tasks by attempting to force the tasks in a cgroup into a
16 quiescent state. Once the tasks are quiescent another task can
18 quiesced tasks. Checkpointed tasks can be restarted later should a
19 recoverable error occur. This also allows the checkpointed tasks to be
21 to another node and restarting the tasks there.
24 and resuming tasks in userspace. Both of these signals are observable
[all …]
|
| D | cpuacct.rst | 5 The CPU accounting controller is used to group tasks using cgroups and
6 account the CPU usage of these groups of tasks.
9 group accumulates the CPU usage of all of its child groups and the tasks
17 visible at /sys/fs/cgroup. At bootup, this group includes all the tasks in
18 the system. /sys/fs/cgroup/tasks lists the tasks in this cgroup.
20 by this group which is essentially the CPU time obtained by all the tasks
27 # echo $$ > g1/tasks
38 user: Time spent by tasks of the cgroup in user mode.
39 system: Time spent by tasks of the cgroup in kernel mode.
|
| D | cgroups.rst | 45 tasks, and all their future children, into hierarchical groups with
50 A *cgroup* associates a set of tasks with a set of parameters for one
54 facilities provided by cgroups to treat groups of tasks in
67 cgroups. Each hierarchy is a partition of all tasks in the system.
81 tasks in each cgroup.
100 the division of tasks into cgroups is distinctly different for
102 hierarchy to be a natural division of tasks, without having to handle
103 complex combinations of tasks that would be present if several
114 tasks etc. The resource planning for this server could be along the
123 In addition (system tasks) are attached to topcpuset (so
[all …]
|
| D | cpusets.rst | 44 Nodes to a set of tasks. In this document "Memory Node" refers to
47 Cpusets constrain the CPU and Memory placement of tasks to only
82 the available CPU and Memory resources amongst the requesting tasks.
139 - You can list all the tasks (by pid) attached to any cpuset.
148 - in sched.c migrate_live_tasks(), to keep migrating tasks within
184 - cpuset.sched_relax_domain_level: the searching range when migrating tasks
192 CPUs and Memory Nodes, and attached tasks, are modified by writing
200 on a system into related sets of tasks such that each set is constrained
206 the detailed placement done on individual tasks and memory regions
264 of the rate that the tasks in a cpuset are attempting to free up in
[all …]
|
| /Linux-v6.1/Documentation/admin-guide/hw-vuln/ |
| D | core-scheduling.rst | 6 Core scheduling support allows userspace to define groups of tasks that can
8 group of tasks don't trust another), or for performance usecases (some
20 attacks. It allows HT to be turned on safely by ensuring that only tasks in a
35 Using this feature, userspace defines groups of tasks that can be co-scheduled
37 tasks that are not in the same group never run simultaneously on a core, while
42 well as admission and removal of tasks from created groups::
67 will be performed for all tasks in the task group of ``pid``.
77 Building hierarchies of tasks
87 Transferring a cookie between the current and other tasks is possible using
91 scheduling group and share it with already running tasks.
[all …]
|
| /Linux-v6.1/Documentation/scheduler/ |
| D | sched-deadline.rst | 12 3. Scheduling Real-Time Tasks
22 5. Tasks CPU affinity
43 that makes it possible to isolate the behavior of tasks between each other.
53 "deadline", to schedule tasks. A SCHED_DEADLINE task should receive
58 consistent with the guarantee (using the CBS[2,3] algorithm). Tasks are then
65 Summing up, the CBS[2,3] algorithm assigns scheduling deadlines to tasks so
67 interference between different tasks (bandwidth isolation), while the EDF[1]
69 to be executed next. Thanks to this feature, tasks that do not strictly comply
74 tasks in the following way:
128 Bandwidth reclaiming for deadline tasks is based on the GRUB (Greedy
[all …]
|
| D | sched-design-CFS.rst | 19 1/nr_running speed. For example: if there are 2 tasks running, then it runs
26 is its actual runtime normalized to the total number of running tasks.
37 Small detail: on "ideal" hardware, at any time all tasks would have the same
38 p->se.vruntime value --- i.e., tasks would execute simultaneously and no task
44 up CPU time between runnable tasks as close to "ideal multitasking hardware" as
62 increasing value tracking the smallest vruntime among all tasks in the
67 The total number of running tasks in the runqueue is accounted through the
68 rq->cfs.load value, which is the sum of the weights of the tasks queued on the
71 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
73 As the system progresses forwards, the executed tasks are put into the tree
[all …]
|
| D | sched-rt-group.rst | 14 2.3 Basis for grouping tasks
44 multiple groups of realtime tasks, each group must be assigned a fixed portion
57 tasks (SCHED_OTHER). Any allocated run time not used will also be picked up by
72 The remaining CPU time will be used for user input and other tasks. Because
73 realtime tasks have explicitly allocated the CPU time they need to perform
74 their tasks, buffer underruns in the graphics or audio can be eliminated.
110 SCHED_OTHER (non-RT tasks). These defaults were chosen so that a run-away
111 realtime tasks will not lock up the machine but leave a little time to recover
120 bandwidth to the group before it will accept realtime tasks. Therefore you will
121 not be able to run realtime tasks as any user other than root until you have
[all …]
|
| D | schedutil.rst | 15 individual tasks to task-group slices to CPU runqueues. As the basis for this
28 is key, since it gives the ability to recompose the averages when tasks move
31 Note that blocked tasks still contribute to the aggregates (task-group slices
96 Because periodic tasks have their averages decayed while they sleep, even
105 A further runqueue wide sum (of runnable tasks) is maintained of:
116 the runqueue keeps an max aggregate of these clamps for all running tasks.
148 XXX: deadline tasks (Sporadic Task Model) allows us to calculate a hard f_min
166 suppose we have a CPU saturated with 4 tasks, then when we migrate a task
|
| /Linux-v6.1/Documentation/power/ |
| D | freezing-of-tasks.rst | 2 Freezing of tasks
7 I. What is the freezing of tasks?
10 The freezing of tasks is a mechanism by which user space processes and some
18 and PF_FREEZER_SKIP (the last one is auxiliary). The tasks that have
30 All freezable tasks must react to that by calling try_to_freeze(), which
62 initiated a freezing operation, the freezing of tasks will fail and the entire
69 order to clear the PF_FROZEN flag for each frozen task. Then, the tasks that
73 Rationale behind the functions dealing with freezing and thawing of tasks
77 - freezes only userspace tasks
80 - freezes all tasks (including kernel threads) because we can't freeze
[all …]
|
| /Linux-v6.1/Documentation/livepatch/ |
| D | livepatch.rst | 85 transition state where tasks are converging to the patched state.
87 sequence occurs when a patch is disabled, except the tasks converge from
91 interrupts. The same is true for forked tasks: the child inherits the
95 safe to patch tasks:
98 tasks. If no affected functions are on the stack of a given task,
100 the tasks on the first try. Otherwise it'll keep trying
108 a) Patching I/O-bound user tasks which are sleeping on an affected
111 b) Patching CPU-bound user tasks. If the task is highly CPU-bound
115 3. For idle "swapper" tasks, since they don't ever exit the kernel, they
122 the second approach. It's highly likely that some tasks may still be
[all …]
|
| /Linux-v6.1/kernel/livepatch/ |
| D | transition.c | 29 * "straggler" tasks which failed to transition in the first attempt.
45 * tasks even in userspace and idle.
86 * All tasks have transitioned to KLP_UNPATCHED so we can now in klp_complete_transition()
300 * on other methods (e.g., switching tasks at kernel exit). in klp_try_switch_task()
338 * Sends a fake signal to all non-kthread tasks with TIF_PATCH_PENDING set.
346 pr_notice("signaling remaining tasks\n"); in klp_send_signals()
367 * Send fake signal to all non-kthread tasks which are in klp_send_signals()
377 * Try to switch all remaining tasks to the target patch state by walking the
378 * stacks of sleeping tasks and looking for any to-be-patched or
382 * If any tasks are still stuck in the initial patch state, schedule a retry.
[all …]
|
| /Linux-v6.1/kernel/rcu/ |
| D | tasks.h | 24 * struct rcu_tasks_percpu - Per-CPU component of definition for a Tasks-RCU-like mechanism.
32 * @rtp_blkd_tasks: List of tasks blocked as readers.
50 * struct rcu_tasks - Definition for a Tasks-RCU-like mechanism.
139 /* Track exiting tasks in order to allow them to be waited for. */
167 /* RCU tasks grace-period state for debugging. */
224 // Tasks RCU.
280 // Enqueue a callback for the specified flavor of Tasks RCU.
346 // Wait for all in-flight callbacks for the specified RCU Tasks flavor.
534 // RCU-tasks kthread that detects grace periods and invokes callbacks.
546 * one RCU-tasks grace period and then invokes the callbacks. in rcu_tasks_kthread()
[all …]
|
| /Linux-v6.1/include/linux/ |
| D | psi_types.h | 19 * For IO and CPU stalls the presence of running/oncpu tasks
54 * SOME: Stalled tasks & working tasks
55 * FULL: Stalled tasks & no working tasks
87 /* States of the tasks belonging to this group */
88 unsigned int tasks[NR_PSI_TASK_COUNTS]; member
90 /* Aggregate pressure state derived from the tasks */
|
| /Linux-v6.1/tools/perf/scripts/python/ |
| D | sched-migration.py | 100 def __init__(self, tasks = [0], event = RunqueueEventUnknown()): argument
101 self.tasks = tuple(tasks)
107 if taskState(prev_state) == "R" and next in self.tasks \
108 and prev in self.tasks:
114 next_tasks = list(self.tasks[:])
115 if prev in self.tasks:
127 if old not in self.tasks:
129 next_tasks = [task for task in self.tasks if task != old]
134 if new in self.tasks:
137 next_tasks = self.tasks[:] + tuple([new])
[all …]
|
| /Linux-v6.1/tools/testing/selftests/futex/include/ |
| D | futextest.h | 84 * futex_wake() - wake one or more tasks blocked on uaddr
85 * @nr_wake: wake up to this many tasks
106 * futex_wake_bitset() - wake one or more tasks blocked on uaddr with bitset
149 * @nr_wake: wake up to this many tasks
150 * @nr_requeue: requeue up to this many tasks
164 * futex_cmp_requeue() - requeue tasks from uaddr to uaddr2
165 * @nr_wake: wake up to this many tasks
166 * @nr_requeue: requeue up to this many tasks
193 * futex_cmp_requeue_pi() - requeue tasks from uaddr to uaddr2 (PI aware)
196 * @nr_wake: wake up to this many tasks
[all …]
|
| /Linux-v6.1/Documentation/locking/ |
| D | futex-requeue-pi.rst | 5 Requeueing of tasks from a non-PI futex to a PI futex requires
17 pthread_cond_broadcast() must resort to waking all the tasks waiting
47 Once pthread_cond_broadcast() requeues the tasks, the cond->mutex
54 be able to requeue tasks to PI futexes. This support implies that
113 possibly wake the waiting tasks. Internally, this system call is
118 nr_wake+nr_requeue tasks to the PI futex, calling
126 requeue up to nr_wake + nr_requeue tasks. It will wake only as many
127 tasks as it can acquire the lock for, which in the majority of cases
|
| /Linux-v6.1/Documentation/RCU/ |
| D | stallwarn.rst | 117 The RCU, RCU-sched, and RCU-tasks implementations have CPU stall warning.
208 This boot/sysfs parameter controls the RCU-tasks stall warning
209 interval. A value of zero or less suppresses RCU-tasks stall
211 in seconds. An RCU-tasks stall warning starts with the line:
213 INFO: rcu_tasks detected stalls on tasks:
216 task stalling the current RCU-tasks grace period.
222 For non-RCU-tasks flavors of RCU, when a CPU detects that some other
225 INFO: rcu_sched detected stalls on CPUs/tasks:
233 PREEMPT_RCU builds can be stalled by tasks as well as by CPUs, and that
234 the tasks will be indicated by PID, for example, "P3421". It is even
[all …]
|
| /Linux-v6.1/kernel/sched/ |
| D | psi.c | 11 * When CPU, memory and IO are contended, tasks experience delays that
30 * In the SOME state of a given resource, one or more tasks are
32 * perform work, but the CPU may still be executing other tasks.
34 * In the FULL state of a given resource, all non-idle tasks are
48 * FULL means all non-idle tasks in the cgroup are delayed on the CPU
62 * The more tasks and available CPUs there are, the more work can be
65 * tasks and CPUs.
67 * Consider a scenario where 257 number crunching tasks are trying to
75 * Conversely, consider a scenario of 4 tasks and 4 CPUs where at any
76 * given time *one* of the tasks is delayed due to a lack of memory.
[all …]
|
| /Linux-v6.1/tools/perf/Documentation/ |
| D | perf-timechart.txt | 48 --tasks-only::
60 Print task info for at least given number of tasks.
65 Highlight tasks (using different color) that run more than given
66 duration or tasks with given name. If number is given it's interpreted
89 --tasks-only::
90 Record only tasks-related events
114 then generate timechart and highlight 'gcc' tasks:
|
| /Linux-v6.1/kernel/power/ |
| D | process.c | 71 * We need to retry, but first give the freezing tasks some in try_to_freeze_tasks()
86 pr_err("Freezing of tasks %s after %d.%03d seconds " in try_to_freeze_tasks()
87 "(%d tasks refusing to freeze, wq_busy=%d):\n", in try_to_freeze_tasks()
146 * killable tasks. There is no guarantee oom victims will in freeze_processes()
162 * (if any) before thawing the userspace tasks. So, it is the responsibility
163 * of the caller to thaw the userspace tasks, when the time is right.
169 pr_info("Freezing remaining freezable tasks ... "); in freeze_kernel_threads()
197 pr_info("Restarting tasks ... "); in thaw_processes()
|
| /Linux-v6.1/tools/perf/bench/ |
| D | futex.h | 73 * futex_wake() - wake one or more tasks blocked on uaddr
74 * @nr_wake: wake up to this many tasks
101 * futex_cmp_requeue() - requeue tasks from uaddr to uaddr2
102 * @nr_wake: wake up to this many tasks
103 * @nr_requeue: requeue up to this many tasks
130 * futex_cmp_requeue_pi() - requeue tasks from uaddr to uaddr2
133 * @nr_requeue: requeue up to this many tasks
|
| /Linux-v6.1/include/uapi/linux/ |
| D | cgroupstats.h | 33 __u64 nr_sleeping; /* Number of tasks sleeping */
34 __u64 nr_running; /* Number of tasks running */
35 __u64 nr_stopped; /* Number of tasks in stopped state */
36 __u64 nr_uninterruptible; /* Number of tasks in uninterruptible */
38 __u64 nr_io_wait; /* Number of tasks waiting on IO */
|
| /Linux-v6.1/Documentation/admin-guide/kdump/ |
| D | gdbmacros.txt | 17 set $tasks_off=((size_t)&((struct task_struct *)0)->tasks)
20 set $next_t=(((char *)($init_t->tasks).next) - $tasks_off)
51 set $next_t=(char *)($next_t->tasks.next) - $tasks_off
83 set $tasks_off=((size_t)&((struct task_struct *)0)->tasks)
86 set $next_t=(((char *)($init_t->tasks).next) - $tasks_off)
97 set $next_t=(char *)($next_t->tasks.next) - $tasks_off
106 set $tasks_off=((size_t)&((struct task_struct *)0)->tasks)
109 set $next_t=(((char *)($init_t->tasks).next) - $tasks_off)
127 set $next_t=(char *)($next_t->tasks.next) - $tasks_off
139 set $tasks_off=((size_t)&((struct task_struct *)0)->tasks)
[all …]
|
| /Linux-v6.1/Documentation/x86/x86_64/ |
| D | fake-numa-for-cpusets.rst | 14 assign them to cpusets and their attached tasks. This is a way of limiting the
15 amount of system memory that are available to a certain class of tasks.
56 You can now assign tasks to these cpusets to limit the memory resources
59 [root@xroads /exampleset/ddset]# echo $$ > tasks
75 This allows for coarse memory management for the tasks you assign to particular
77 interesting combinations of use-cases for various classes of tasks for your
|
