Searched refs:runqueue (Results 1 – 10 of 10) sorted by relevance
/Linux-v5.10/Documentation/scheduler/ |
D | sched-domains.rst | 36 rebalancing event for the current runqueue has arrived. The actual load 49 If it succeeds, it looks for the busiest runqueue of all the CPUs' runqueues in 50 that group. If it manages to find such a runqueue, it locks both our initial 51 CPU's runqueue and the newly found busiest one and starts moving tasks from it 52 to our runqueue. The exact number of tasks amounts to an imbalance previously
|
D | sched-arch.rst | 10 By default, the switch_to arch function is called with the runqueue 12 take the runqueue lock. This is usually due to a wake up operation in 15 To request the scheduler call switch_to with the runqueue unlocked,
|
D | sched-design-CFS.rst | 63 runqueue. The total amount of work done by the system is tracked using 67 The total number of running tasks in the runqueue is accounted through the 69 runqueue. 112 SMP load-balancing has been reworked/sanitized: the runqueue-walking
|
D | sched-deadline.rst | 182 In addition, if the task wakes up on a different runqueue, then 183 the task's utilization must be removed from the previous runqueue's active 184 utilization and must be added to the new runqueue's active utilization. 185 In order to avoid races between a task waking up on a runqueue while the 187 flag is used to indicate that a task is not on a runqueue but is active 192 its utilization is removed from the runqueue's active utilization. 195 its utilization is added to the active utilization of the runqueue where 198 For each runqueue, the algorithm GRUB keeps track of two different bandwidths: 204 runqueue, including the tasks in Inactive state. 218 - Uinact is the (per runqueue) inactive utilization, computed as [all …]
|
D | sched-stats.rst | 12 release). Some counters make more sense to be per-runqueue; other to be 159 2) time spent waiting on a runqueue
|
/Linux-v5.10/drivers/gpu/drm/exynos/ |
D | exynos_drm_g2d.c | 254 struct list_head runqueue; member 820 if (list_empty(&g2d->runqueue)) in g2d_get_runqueue_node() 823 runqueue_node = list_first_entry(&g2d->runqueue, in g2d_get_runqueue_node() 858 if (list_empty(&g2d->runqueue)) in g2d_remove_runqueue_nodes() 861 list_for_each_entry_safe(node, n, &g2d->runqueue, list) { in g2d_remove_runqueue_nodes() 1329 list_add_tail(&runqueue_node->list, &g2d->runqueue); in exynos_g2d_exec_ioctl() 1473 INIT_LIST_HEAD(&g2d->runqueue); in g2d_probe()
|
/Linux-v5.10/Documentation/virt/kvm/ |
D | halt-polling.rst | 18 interval or some other task on the runqueue is runnable the scheduler is
|
/Linux-v5.10/drivers/staging/wlan-ng/ |
D | hfa384x_usb.c | 1105 int runqueue = 0; in hfa384x_usbctlx_complete_sync() local 1127 runqueue = 1; in hfa384x_usbctlx_complete_sync() 1148 if (runqueue) in hfa384x_usbctlx_complete_sync()
|
/Linux-v5.10/Documentation/admin-guide/cgroup-v1/ |
D | cpusets.rst | 552 And if a CPU run out of tasks in its runqueue, the CPU try to pull
|
/Linux-v5.10/Documentation/RCU/Design/Requirements/ |
D | Requirements.rst | 1956 scheduler's runqueue or priority-inheritance spinlocks across an
|