| /linux/Documentation/admin-guide/cgroup-v1/ |
| A D | freezer-subsystem.rst | 6 and stop sets of tasks in order to schedule the resources of a machine
11 a means to start and stop the tasks composing the job.
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
21 to another node and restarting the tasks there.
49 have a problem with this method of stopping and resuming tasks.
70 FREEZING cgroup transitions into FROZEN state when all tasks
105 # echo $some_pid > /sys/fs/cgroup/freezer/0/tasks
112 to freeze all tasks in the container::
[all …]
|
| 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 of the cgroup in kernel mode.
|
| A D | cgroups.rst | 81 tasks in each cgroup.
191 css_set->tasks.
239 - tasks: list of tasks (by PID) attached to that cgroup. This list
339 /bin/echo $$ > tasks
425 # /bin/echo $$ > tasks
445 # /bin/echo PID > tasks
450 # /bin/echo PID1 > tasks
451 # /bin/echo PID2 > tasks
453 # /bin/echo PIDn > tasks
457 # echo 0 > tasks
[all …]
|
| /linux/Documentation/admin-guide/hw-vuln/ |
| 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
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
91 scheduling group and share it with already running tasks.
158 cookie-0 tasks is also avoided.
160 Once userspace uses the above mentioned interfaces to group sets of tasks, tasks
162 outside. Tasks outside the group also don't trust tasks within.
207 allowing system processes (trusted tasks) to share a core.
[all …]
|
| /linux/Documentation/scheduler/ |
| 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
|
| A D | sched-design-CFS.rst | 30 is its actual runtime normalized to the total number of running tasks.
66 increasing value tracking the smallest vruntime among all tasks in the
132 policy that is used for regular tasks.
134 - SCHED_BATCH: Does not preempt nearly as often as regular tasks
135 would, thereby allowing tasks to run longer and make better use of
225 SCHED_RR) tasks.
228 SCHED_BATCH) tasks.
243 # mkdir multimedia # create "multimedia" group of tasks
244 # mkdir browser # create "browser" group of tasks
253 # echo <firefox_pid> > browser/tasks
[all …]
|
| A D | sched-deadline.rst | 53 "deadline", to schedule tasks. A SCHED_DEADLINE task should receive
74 tasks in the following way:
204 runqueue, including the tasks in Inactive state.
207 deadline tasks and is currently set to the RT capacity.
272 there are no inactive tasks.
355 non- real-time tasks by real-time tasks.
382 of all the tasks running on a CPU if the sum of the densities of the tasks
459 tasks are not starved and that the tardiness of real-time tasks has an upper
464 the tasks are limited.
667 SCHED_DEADLINE tasks.
[all …]
|
| A D | sched-util-clamp.rst | 35 One can tell the system (scheduler) that some tasks require a minimum
66 tasks are the tasks the user is currently interacting with, hence
67 the most important tasks in the system.
69 are CPU intensive tasks.
112 MAX for all RT tasks.
140 enqueued tasks.
150 task on the rq to only a subset of tasks on the top-most bucket.
448 to restrict how much boosting tasks are allowed to acquire.
492 For SCHED_FIFO/SCHED_RR tasks:
543 4.1. Boost important and DVFS-latency-sensitive tasks
[all …]
|
| A D | sched-rt-group.rst | 14 2.3 Basis for grouping tasks
44 multiple groups of real-time 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 real-time tasks have explicitly allocated the CPU time they need to perform
74 their tasks, buffer underruns in the graphics or audio can be eliminated.
112 SCHED_OTHER (non-RT tasks). These defaults were chosen so that a run-away
113 real-time tasks will not lock up the machine but leave a little time to recover
123 not be able to run real-time tasks as any user other than root until you have
128 2.3 Basis for grouping tasks
[all …]
|
| 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
|
| /linux/Documentation/power/ |
| 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
38 tasks are generally frozen before kernel threads.
87 - freezes only userspace tasks
91 kernel threads without freezing userspace tasks
96 userspace tasks, or if we want to postpone the thawing of userspace tasks
100 tasks without thawing kernel threads
182 V. Are there any problems related to the freezing of tasks?
[all …]
|
| /linux/drivers/gpu/drm/ |
| A D | drm_flip_work.c | 104 struct list_head tasks; in flip_worker() local
110 INIT_LIST_HEAD(&tasks); in flip_worker()
112 list_splice_tail(&work->commited, &tasks); in flip_worker()
116 if (list_empty(&tasks)) in flip_worker()
119 list_for_each_entry_safe(task, tmp, &tasks, node) { in flip_worker()
|
| /linux/tools/perf/scripts/python/ |
| A D | sched-migration.py | 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:
134 if new in self.tasks:
137 next_tasks = self.tasks[:] + tuple([new])
153 return len(self.tasks) - 1
156 ret = self.tasks.__repr__()
[all …]
|
| /linux/kernel/sched/ |
| A D | psi.c | 225 if (tasks[NR_IOWAIT]) { in test_states()
227 if (!tasks[NR_RUNNING]) in test_states()
231 if (tasks[NR_MEMSTALL]) { in test_states()
233 if (tasks[NR_RUNNING] == tasks[NR_MEMSTALL_RUNNING]) in test_states()
243 if (tasks[NR_IOWAIT] || tasks[NR_MEMSTALL] || tasks[NR_RUNNING]) in test_states()
271 memcpy(tasks, groupc->tasks, sizeof(groupc->tasks)); in get_recent_times()
310 tasks[NR_IOWAIT] + in get_recent_times()
818 if (groupc->tasks[t]) { in psi_group_change()
819 groupc->tasks[t]--; in psi_group_change()
823 groupc->tasks[1], groupc->tasks[2], in psi_group_change()
[all …]
|
| /linux/samples/bpf/ |
| 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()
|
| A D | test_overhead_user.c | 108 static void run_perf_test(int tasks, int flags) in run_perf_test() argument
110 pid_t pid[tasks]; in run_perf_test()
113 for (i = 0; i < tasks; i++) { in run_perf_test()
123 for (i = 0; i < tasks; i++) { in run_perf_test()
|
| /linux/tools/perf/Documentation/ |
| 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/ |
| 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/arch/x86/x86_64/ |
| 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/ |
| A D | livepatch.rst | 85 transition state where tasks are converging to the patched state.
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
122 the second approach. It's highly likely that some tasks may still be
124 returns. In this case you would have to signal the tasks. This
139 the transition is in progress. Then all the tasks will attempt to
156 TIF_PATCH_PENDING flag of all tasks and thus forces the tasks to the patched
[all …]
|
| /linux/Documentation/locking/ |
| 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/ |
| 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/ |
| A D | stallwarn.rst | 118 The RCU, RCU-sched, RCU-tasks, and RCU-tasks-trace implementations have
209 This boot/sysfs parameter controls the RCU-tasks and
210 RCU-tasks-trace stall warning intervals. A value of zero or less
211 suppresses RCU-tasks stall warnings. A positive value sets the
212 stall-warning interval in seconds. An RCU-tasks stall warning
215 INFO: rcu_tasks detected stalls on tasks:
218 task stalling the current RCU-tasks grace period.
222 INFO: rcu_tasks_trace detected stalls on tasks
231 INFO: rcu_sched detected stalls on CPUs/tasks:
388 tasks as well as by CPUs, and that the tasks will be indicated by PID,
[all …]
|
| /linux/tools/testing/selftests/resctrl/ |
| A D | resctrlfs.c | 499 static int write_pid_to_tasks(char *tasks, pid_t pid) in write_pid_to_tasks() argument
503 fp = fopen(tasks, "w"); in write_pid_to_tasks()
537 char tasks[1024]; in write_bm_pid_to_resctrl() local
549 sprintf(tasks, "%s/tasks", controlgroup); in write_bm_pid_to_resctrl()
550 ret = write_pid_to_tasks(tasks, bm_pid); in write_bm_pid_to_resctrl()
562 sprintf(tasks, "%s/mon_groups/%s/tasks", in write_bm_pid_to_resctrl()
564 ret = write_pid_to_tasks(tasks, bm_pid); in write_bm_pid_to_resctrl()
|
| /linux/tools/testing/selftests/bpf/progs/ |
| A D | bpf_iter_task_btf.c | 11 long tasks = 0; variable
33 tasks++; in dump_task_struct()
|