| /linux/Documentation/admin-guide/cgroup-v1/ |
| H A 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 t
[all...] |
| H A 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 o
[all...] |
| H A 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.
102 the division of tasks into cgroups is distinctly different for
104 hierarchy to be a natural division of tasks, without having to handle
105 complex combinations of tasks that would be present if several
116 tasks etc. The resource planning for this server could be along the
125 In addition (system tasks) ar
[all...] |
| /linux/Documentation/admin-guide/hw-vuln/ |
| H A 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/tools/accounting/ |
| H A D | delaytop.c | 9 * containers (cgroups), or individual tasks (PIDs).
64 #define SET_TASK_STAT(task_count, field) tasks[task_count].field = stats.field
136 static struct task_info tasks[MAX_TASKS]; variable
509 tasks[task_count].pid = pid; in fetch_and_fill_task_info()
510 tasks[task_count].tgid = pid; in fetch_and_fill_task_info()
511 strncpy(tasks[task_count].command, comm, in fetch_and_fill_task_info()
513 tasks[task_count].command[TASK_COMM_LEN - 1] = '\0'; in fetch_and_fill_task_info()
585 /* Comparison function for sorting tasks */
605 /* Sort tasks by selected field */
609 qsort(tasks, task_coun in sort_tasks()
[all...] |
| /linux/Documentation/scheduler/ |
| H A D | sched-eevdf.rst | 14 runnable tasks with the same priority. To do so, it assigns a virtual run
18 has exceeded its portion. EEVDF picks tasks with lag greater or equal to
21 allows latency-sensitive tasks with shorter time slices to be prioritized,
25 tasks; but at the time of writing EEVDF uses a "decaying" mechanism based
26 on virtual run time (VRT). This prevents tasks from exploiting the system
29 lag to decay over VRT. Hence, long-sleeping tasks eventually have their lag
30 reset. Finally, tasks can preempt others if their VD is earlier, and tasks
|
| H A D | sched-design-CFS.rst | 23 1/nr_running speed. For example: if there are 2 tasks running, then it runs
30 is its actual runtime normalized to the total number of running tasks.
41 Small detail: on "ideal" hardware, at any time all tasks would have the same
42 p->se.vruntime value --- i.e., tasks would execute simultaneously and no task
48 up CPU time between runnable tasks as close to "ideal multitasking hardware" as
66 increasing value tracking the smallest vruntime among all tasks in the
71 The total number of running tasks in the runqueue is accounted through the
72 rq->cfs.load value, which is the sum of the weights of the tasks queued on the
75 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
77 As the system progresses forwards, the executed tasks ar
[all...] |
| H A D | sched-deadline.rst | 44 that makes it possible to isolate the behavior of tasks between each other.
54 "deadline", to schedule tasks. A SCHED_DEADLINE task should receive
66 Summing up, the CBS[2,3] algorithm assigns scheduling deadlines to tasks so
68 interference between different tasks (bandwidth isolation), while the EDF[1]
70 to be executed next. Thanks to this feature, tasks that do not strictly comply
75 tasks in the following way:
129 Bandwidth reclaiming for deadline tasks is based on the GRUB (Greedy
133 The following diagram illustrates the state names for tasks handled by GRUB::
202 tasks in active state (i.e., ActiveContending or ActiveNonContending);
204 - Total bandwidth (this_bw): this is the sum of all tasks "belongin
[all...] |
| H A D | sched-util-clamp.rst | 12 of tasks. It was introduced in v5.3 release. The CGroup support was merged in
16 performance requirements and restrictions of the tasks, thus it helps the
35 One can tell the system (scheduler) that some tasks require a minimum
37 can tell the system that some tasks should be restricted from consuming too
45 dropped. It can also dynamically 'prime' up these tasks if it knows in the
56 Another example is in Android where tasks are classified as background,
58 resources background tasks are consuming by capping the performance point they
59 can run at. This constraint helps reserve resources for important tasks, like
63 background tasks to stay on the little cores which will ensure that:
65 1. The big cores are free to run top-app tasks immediatel
[all...] |
| H A 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
104 A further runqueue wide sum (of runnable tasks) is maintained of:
115 the runqueue keeps an max aggregate of these clamps for all running tasks.
147 XXX: deadline tasks (Sporadic Task Model) allows us to calculate a hard f_min
165 suppose we have a CPU saturated with 4 tasks, then when we migrate a task
|
| H A D | sched-stats.rst | 79 7) sum of all time spent running by tasks on this processor (in nanoseconds)
80 8) sum of all time spent waiting to run by tasks on this processor (in
108 more tasks and failed, when the cpu was busy
111 6) Total imbalance in number of tasks in this domain when the cpu was busy
112 7) Total imbalance due to misfit tasks in this domain when the cpu was
127 more tasks and failed, when the cpu was idle
130 17) Total imbalance in number of tasks in this domain when the cpu was idle
131 18) Total imbalance due to misfit tasks in this domain when the cpu was
147 tasks and failed, when the cpu was just becoming idle
152 28) Total imbalance in number of tasks i
[all...] |
| /linux/Documentation/power/ |
| H A 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
19 The tasks that have PF_NOFREEZE unset (all user space tasks and some kernel
31 wakes up all the kernel threads. All freezable tasks must react to that by
38 tasks are generally frozen before kernel threads.
72 has initiated a freezing operation, the freezing of tasks will fail and the
79 order to wake up each frozen task. Then, the tasks that have been frozen leave
83 Rationale behind the functions dealing with freezing and thawing of tasks
[all...] |
| /linux/drivers/gpu/drm/ |
| H A D | drm_flip_work.c | 105 struct list_head tasks; in flip_worker() local
111 INIT_LIST_HEAD(&tasks); in flip_worker()
113 list_splice_tail(&work->commited, &tasks); in flip_worker()
117 if (list_empty(&tasks)) in flip_worker()
120 list_for_each_entry_safe(task, tmp, &tasks, node) { in flip_worker()
|
| /linux/tools/perf/scripts/python/ |
| H A 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
[all...] |
| /linux/kernel/sched/ |
| H A 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 i
243 test_states(unsigned int * tasks,u32 state_mask) test_states() argument
277 unsigned int tasks[NR_PSI_TASK_COUNTS]; get_recent_times() local
[all...] |
| /linux/samples/bpf/ |
| H A D | map_perf_test_user.c | 94 static int pre_test_lru_hash_lookup(int tasks) in pre_test_lru_hash_lookup() argument
295 typedef int (*pre_test_func)(int tasks);
315 static int pre_test(int tasks) in pre_test() argument
321 int ret = pre_test_funcs[i](tasks); in pre_test()
346 static void run_perf_test(int tasks) in run_perf_test() argument
348 pid_t pid[tasks]; in run_perf_test()
351 assert(!pre_test(tasks)); in run_perf_test()
353 for (i = 0; i < tasks; i++) { in run_perf_test()
363 for (i = 0; i < tasks; i++) { in run_perf_test()
|
| /linux/tools/perf/Documentation/ |
| H A 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/Documentation/admin-guide/kdump/ |
| H A 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/Documentation/sound/designs/ |
| H A D | compress-accel.rst | 12 tasks for user space such as sample rate converters, compressed
16 is able to handle "tasks" that are not bound to real-time operations
24 - serialization of multiple tasks for user space to allow multiple
52 For the buffering parameters, the fragments means a limit of allocated tasks
99 tasks.
115 If the multiple tasks require a state handling (e.g. resampling operation),
123 tasks.
|
| /linux/Documentation/arch/x86/x86_64/ |
| H A 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
|
| /linux/Documentation/livepatch/ |
| H A 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 ma
[all...] |
| /linux/Documentation/locking/ |
| H A 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/drivers/misc/bcm-vk/ |
| H A D | Kconfig | 11 multiple specific offload processing tasks in parallel.
12 Such offload tasks assist in such operations as video
13 transcoding, compression, and crypto tasks.
|
| /linux/Documentation/RCU/ |
| H A D | stallwarn.rst | 125 The RCU, RCU-sched, RCU-tasks, and RCU-tasks-trace implementations have
216 This boot/sysfs parameter controls the RCU-tasks and
217 RCU-tasks-trace stall warning intervals. A value of zero or less
218 suppresses RCU-tasks stall warnings. A positive value sets the
219 stall-warning interval in seconds. An RCU-tasks stall warning
222 INFO: rcu_tasks detected stalls on tasks:
225 task stalling the current RCU-tasks grace period.
227 An RCU-tasks-trace stall warning starts (and continues) similarly:
229 INFO: rcu_tasks_trace detected stalls on tasks
[all...] |
| /linux/tools/testing/selftests/bpf/progs/ |
| H A D | bpf_iter_task_btf.c | 11 long tasks = 0; variable
33 tasks++; in dump_task_struct()
|