Searched full:scheduling (Results 1 – 25 of 71) sorted by relevance
123
| /Documentation/timers/ |
| D | no_hz.rst | 2 NO_HZ: Reducing Scheduling-Clock Ticks
7 reduce the number of scheduling-clock interrupts, thereby improving energy
12 There are three main ways of managing scheduling-clock interrupts
13 (also known as "scheduling-clock ticks" or simply "ticks"):
15 1. Never omit scheduling-clock ticks (CONFIG_HZ_PERIODIC=y or
19 2. Omit scheduling-clock ticks on idle CPUs (CONFIG_NO_HZ_IDLE=y or
23 3. Omit scheduling-clock ticks on CPUs that are either idle or that
33 Never Omit Scheduling-Clock Ticks
37 are incapable of omitting scheduling-clock ticks. It turns out that
42 hundreds of microseconds). For these types of workloads, scheduling
[all …]
|
| D | timekeeping.rst | 18 sched_clock() is used for scheduling and timestamping, and delay timers
118 As the name suggests, sched_clock() is used for scheduling the system,
135 jiffy frequency for the architecture. This will affect scheduling accuracy
139 suspend/sleep. This does not matter to the function it serves of scheduling
|
| D | timers-howto.rst | 109 TASK_INTERRUPTIBLE before scheduling the sleep. In
|
| /Documentation/scheduler/ |
| D | sched-deadline.rst | 2 Deadline Task Scheduling
9 2. Scheduling algorithm
12 3. Scheduling Real-Time Tasks
33 system behavior. As for -rt (group) scheduling, it is assumed that root users
40 The SCHED_DEADLINE policy contained inside the sched_dl scheduling class is
41 basically an implementation of the Earliest Deadline First (EDF) scheduling
46 2. Scheduling algorithm
57 every time the task wakes up, the scheduler computes a "scheduling deadline"
59 scheduled using EDF[1] on these scheduling deadlines (the task with the
60 earliest scheduling deadline is selected for execution). Notice that the
[all …]
|
| D | sched-rt-group.rst | 2 Real-Time group scheduling
42 Realtime scheduling is all about determinism, a group has to be able to rely on
90 The scheduling period that is equivalent to 100% CPU bandwidth
93 A global limit on how much time realtime scheduling may use. Even without
119 Realtime group scheduling means you have to assign a portion of total CPU
151 There is work in progress to make the scheduling period for each group
156 as its prone to starvation without deadline scheduling.
173 The next project will be SCHED_EDF (Earliest Deadline First scheduling) to bring
174 full deadline scheduling to the linux kernel. Deadline scheduling the above
180 the limited static priority levels 0-99. With deadline scheduling you need to
|
| D | sched-design-CFS.rst | 114 scheduling modules are used. The balancing code got quite a bit simpler as a
119 5. Scheduling policies
122 CFS implements three scheduling policies:
124 - SCHED_NORMAL (traditionally called SCHED_OTHER): The scheduling
144 6. SCHEDULING CLASSES
147 The new CFS scheduler has been designed in such a way to introduce "Scheduling
149 encapsulate scheduling policy details and are handled by the scheduler core
159 Scheduling classes are implemented through the sched_class structure, which
168 It puts the scheduling entity (task) into the red-black tree and
174 corresponding scheduling entity out of the red-black tree. It decrements
[all …]
|
| D | sched-domains.rst | 5 Each CPU has a "base" scheduling domain (struct sched_domain). The domain
10 Each scheduling domain spans a number of CPUs (stored in the ->span field).
19 Each scheduling domain must have one or more CPU groups (struct sched_group)
26 flag is set on the corresponding scheduling domain and its groups may not be
|
| D | sched-energy.rst | 2 Energy Aware Scheduling
8 Energy Aware Scheduling (or EAS) gives the scheduler the ability to predict
20 because this is where the potential for saving energy through scheduling is
88 scheduling domains are built, or re-built. For each root domain (rd), the
312 (than CFS) scheduling classes (as well as IRQ) must be taken into account. As
314 by CFS tasks, but also by the other scheduling classes and IRQ.
320 Energy Aware Scheduling depends on the CPUs of the system having specific
331 looking for the presence of the SD_ASYM_CPUCAPACITY flag when the scheduling
345 EAS uses the EM of a platform to estimate the impact of scheduling decisions on
350 Please also note that the scheduling domains need to be re-built after the
[all …]
|
| D | sched-capacity.rst | 2 Capacity Aware Scheduling
132 Capacity aware scheduling requires an expression of a task's requirements with
247 This means that while the capacity aware scheduling criteria will be written
251 3. Capacity aware scheduling requirements
268 As stated in 2.2, capacity-aware scheduling requires a frequency-invariant task
328 5. Capacity aware scheduling implementation
337 The main capacity scheduling criterion of CFS is::
367 Wakeup CPU selection in CFS can be eclipsed by Energy Aware Scheduling
403 the CPU capacity scheduling criterion is violated, and there may not be any more
424 CPUs can satisfy this capacity criterion, then strict priority based scheduling
|
| D | completion.rst | 29 As completions are scheduling related, the code can be found in
237 an impact on how the task is accounted in scheduling/IO stats::
|
| D | sched-nice-design.rst | 110 scheduling policy) is addressed by the new scheduler almost
|
| /Documentation/block/ |
| D | ioprio.rst | 12 scheduling for ages. This document mainly details the current possibilities
15 Scheduling classes
18 CFQ implements three generic scheduling classes that determine how io is
21 IOPRIO_CLASS_RT: This is the realtime io class. This scheduling class is given
30 IOPRIO_CLASS_BE: This is the best-effort scheduling class, which is the default
37 IOPRIO_CLASS_IDLE: This is the idle scheduling class, processes running at this
54 will run ls at the best-effort scheduling class at the highest priority.
59 will change pid 100 to run at the realtime scheduling class, at priority 2.
|
| D | blk-mq.rst | 91 <https://www.kernel.org/doc/html/latest/block/index.html>`_. The scheduling
94 need to have a lock for each queue. After the scheduling, the requests are
|
| D | bfq-iosched.rst | 37 Scheduling overhead further limits the maximum IOPS that a CPU can
69 4. BFQ group scheduling
241 also ready for hierarchical scheduling, details in Section 4.
318 Unless the cgroups interface is used (see "4. BFQ group scheduling"),
495 4. Group scheduling with BFQ
|
| /Documentation/gpu/ |
| D | v3d.rst | 19 GPU Scheduling
22 :doc: Broadcom V3D scheduling
|
| /Documentation/vm/ |
| D | numa.rst | 101 NUMA topology of the platform--embodied in the "scheduling domains" data
103 attempts to minimize task migration to distant scheduling domains. However,
116 privileged user can specify in the scheduling or NUMA commands and functions
|
| /Documentation/accounting/ |
| D | taskstats-struct.rst | 69 /* The scheduling discipline as set in task->policy field. */
70 __u8 ac_sched; /* Scheduling discipline */
|
| /Documentation/driver-api/ |
| D | io-mapping.rst | 27 or not, depending on the necessary scheduling environment. Of course, atomic
|
| D | basics.rst | 18 Delaying, scheduling, and timer routines
|
| /Documentation/ABI/testing/ |
| D | sysfs-platform-hidma-mgmt | 17 equal priority channels during round robin scheduling.
|
| /Documentation/infiniband/ |
| D | core_locking.rst | 73 driver should defer this callback by, for example, scheduling a
|
| /Documentation/driver-api/usb/ |
| D | URB.rst | 255 ``URB_ISO_ASAP`` scheduling is used, ``urb->start_frame`` is also updated.
265 For scheduling you can choose your own start frame or ``URB_ISO_ASAP``. As
|
| /Documentation/virt/kvm/arm/ |
| D | pvtime.rst | 70 The structure will be updated by the hypervisor prior to scheduling a VCPU. It
|
| /Documentation/devicetree/bindings/soc/fsl/ |
| D | qman.txt | 14 supports queuing and QoS scheduling of frames to CPUs, network interfaces and
|
| /Documentation/devicetree/bindings/net/ |
| D | snps,dwmac.yaml | 150 * Choose one of these RX scheduling algorithms
173 * Choose one of these TX scheduling algorithms
|
123