| /linux/kernel/sched/ |
| A D | pelt.c | 107 unsigned long load, unsigned long runnable, int running) in accumulate_sum() argument
147 if (runnable) in accumulate_sum()
148 sa->runnable_sum += runnable * contrib << SCHED_CAPACITY_SHIFT; in accumulate_sum()
185 unsigned long load, unsigned long runnable, int running) in ___update_load_sum() argument
221 runnable = running = 0; in ___update_load_sum()
230 if (!accumulate_sum(delta, sa, load, runnable, running)) in ___update_load_sum()
|
| A D | fair.c | 1460 unsigned long runnable; member
1515 ((ns->compute_capacity * imbalance_pct) < (ns->runnable * 100)))) in numa_classify()
1520 ((ns->compute_capacity * imbalance_pct) > (ns->runnable * 100)))) in numa_classify()
1571 ns->runnable += cpu_runnable(rq); in update_numa_stats()
5809 unsigned int runnable; in cpu_runnable_without() local
5816 runnable = READ_ONCE(cfs_rq->avg.runnable_avg); in cpu_runnable_without()
5819 lsub_positive(&runnable, p->se.avg.runnable_avg); in cpu_runnable_without()
5821 return runnable; in cpu_runnable_without()
|
| /linux/Documentation/scheduler/ |
| A D | schedutil.txt | 31 Using this we track 2 key metrics: 'running' and 'runnable'. 'Running'
32 reflects the time an entity spends on the CPU, while 'runnable' reflects the
36 while 'runnable' will increase to reflect the amount of contention.
79 The result is that the above 'running' and 'runnable' metrics become invariant
101 A further runqueue wide sum (of runnable tasks) is maintained of:
|
| A D | sched-design-CFS.rst | 44 up CPU time between runnable tasks as close to "ideal multitasking hardware" as
71 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
167 Called when a task enters a runnable state.
173 When a task is no longer runnable, this function is called to keep the
185 This function checks if a task that entered the runnable state should
|
| A D | sched-bwc.rst | 15 slices as threads in the cgroup become runnable. Once all quota has been
203 decide which application is chosen to run, as they will both be runnable and
|
| A D | sched-capacity.rst | 242 accurately be predicted the moment a task first becomes runnable. The CFS class
|
| /linux/Documentation/timers/ |
| A D | no_hz.rst | 24 have only one runnable task (CONFIG_NO_HZ_FULL=y). Unless you
44 will frequently be multiple runnable tasks per CPU. In these cases,
107 If a CPU has only one runnable task, there is little point in sending it
109 Note that omitting scheduling-clock ticks for CPUs with only one runnable
113 sending scheduling-clock interrupts to CPUs with a single runnable task,
264 runnable task for a given CPU, even though there are a number
267 runnable high-priority SCHED_FIFO task and an arbitrary number
274 single runnable SCHED_FIFO task and multiple runnable SCHED_OTHER
277 And even when there are multiple runnable tasks on a given CPU,
|
| /linux/Documentation/accounting/ |
| A D | delay-accounting.rst | 7 runnable task may wait for a free CPU to run on.
12 a) waiting for a CPU (while being runnable)
|
| A D | taskstats-struct.rst | 112 /* Delay waiting for cpu, while runnable
|
| /linux/Documentation/virt/ |
| A D | guest-halt-polling.rst | 18 even with other runnable tasks in the host.
|
| /linux/Documentation/virt/kvm/ |
| A D | halt-polling.rst | 18 interval or some other task on the runqueue is runnable the scheduler is
137 - Halt polling will only be conducted by the host when no other tasks are runnable on
|
| A D | api.rst | 5196 KVM automatically accounts running and runnable time but blocked
|
| /linux/Documentation/core-api/ |
| A D | workqueue.rst | 118 number of the currently runnable workers. Generally, work items are
121 stalling should be optimal. As long as there are one or more runnable
205 concurrency level. In other words, runnable CPU intensive
213 regulated by the concurrency management and runnable
|
| /linux/Documentation/admin-guide/pm/ |
| A D | cpuidle.rst | 90 Tasks can be in various states. In particular, they are *runnable* if there are
93 events to occur or similar). When a task becomes runnable, the CPU scheduler
94 assigns it to one of the available CPUs to run and if there are no more runnable
97 another CPU). [If there are multiple runnable tasks assigned to one CPU
101 The special "idle" task becomes runnable if there are no other runnable tasks
193 multiple runnable tasks assigned to one CPU at the same time, the only way to
216 not be shared between multiple runnable tasks, the primary reason for using the
|
| /linux/Documentation/arm64/ |
| A D | asymmetric-32bit.rst | 154 ``KVM_EXIT_FAIL_ENTRY`` and will remain non-runnable until successfully
|
| /linux/Documentation/s390/ |
| A D | vfio-ccw.rst | 331 space, and assemble a runnable kernel channel program by updating the
382 channel program, which becomes runnable for a real device.
|
| /linux/Documentation/admin-guide/hw-vuln/ |
| A D | core-scheduling.rst | 108 highest priority task with the same cookie is selected if there is one runnable
|
| /linux/Documentation/admin-guide/ |
| A D | kernel-per-CPU-kthreads.rst | 159 for example, ensure that at most one runnable kthread is present
|
| /linux/Documentation/process/ |
| A D | license-rules.rst | 356 with this exception. This is required for creating runnable executables
|
| /linux/Documentation/filesystems/ |
| A D | proc.rst | 695 number of processes currently runnable (running or on ready queue);
699 processes currently runnable" and "total number of processes
1526 running or ready to run (i.e., the total number of runnable threads).
2160 out. With CPU isolation and a single runnable task this can take
|
| /linux/Documentation/locking/ |
| A D | rt-mutex-design.rst | 69 of A. So now if B becomes runnable, it would not preempt C, since C now has
|