Searched refs:runnable (Results 1 – 9 of 9) sorted by relevance
| /linux-3.4.99/arch/x86/xen/ |
| D | time.c | 117 s64 runnable, offline, stolen; in do_stolen_accounting() local
127 runnable = state.time[RUNSTATE_runnable] - snap->time[RUNSTATE_runnable]; in do_stolen_accounting()
134 stolen = runnable + offline + __this_cpu_read(xen_residual_stolen); in do_stolen_accounting()
|
| /linux-3.4.99/Documentation/scheduler/ |
| D | sched-design-CFS.txt | 42 up CPU time between runnable tasks as close to "ideal multitasking hardware" as
68 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
163 Called when a task enters a runnable state.
169 When a task is no longer runnable, this function is called to keep the
181 This function checks if a task that entered the runnable state should
|
| /linux-3.4.99/Documentation/accounting/ |
| D | delay-accounting.txt | 6 runnable task may wait for a free CPU to run on.
11 a) waiting for a CPU (while being runnable)
|
| D | taskstats-struct.txt | 100 /* Delay waiting for cpu, while runnable
|
| /linux-3.4.99/Documentation/ |
| D | workqueue.txt | 121 currently runnable workers. Generally, work items are not expected to
124 optimal. As long as there are one or more runnable workers on the
219 runnable work items, they still contribute to the concurrency
220 level. Highpri work items in runnable state will prevent
228 concurrency level. In other words, runnable CPU intensive
236 regulated by the concurrency management and runnable
|
| D | rt-mutex-design.txt | 68 of A. So now if B becomes runnable, it would not preempt C, since C now has
|
| /linux-3.4.99/Documentation/filesystems/nfs/ |
| D | knfsd-stats.txt | 99 runnable nfsd threads. The ideal rate of change for this counter
|
| /linux-3.4.99/lib/ |
| D | Kconfig.debug | 896 bool "torture tests for RCU runnable by default"
|
| /linux-3.4.99/Documentation/filesystems/ |
| D | proc.txt | 1201 running or ready to run (i.e., the total number of runnable threads).
|