Searched full:scheduling (Results 1 – 25 of 96) sorted by relevance
1234
| /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
|
| /Documentation/admin-guide/hw-vuln/ |
| D | core-scheduling.rst | 4 Core Scheduling
6 Core scheduling support allows userspace to define groups of tasks that can
19 scheduling is a scheduler feature that can mitigate some (not all) cross-HT
24 world workloads. In theory, core scheduling aims to perform at least as good as
26 not always: as synchronizing scheduling decisions across 2 or more CPUs in a
29 scheduling to perform more poorly compared to SMT-disabled, where N_CPUS is the
34 Core scheduling support is enabled via the ``CONFIG_SCHED_CORE`` config option.
38 doing its best to satisfy the system's scheduling requirements.
40 Core scheduling can be enabled via the ``PR_SCHED_CORE`` prctl interface.
41 This interface provides support for the creation of core scheduling groups, as
[all …]
|
| D | index.rst | 18 core-scheduling
|
| /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 Real-time 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 real-time scheduling may use. This is always
121 Real-time group scheduling means you have to assign a portion of total CPU
153 There is work in progress to make the scheduling period for each group
158 as its prone to starvation without deadline scheduling.
175 The next project will be SCHED_EDF (Earliest Deadline First scheduling) to bring
176 full deadline scheduling to the linux kernel. Deadline scheduling the above
182 the limited static priority levels 0-99. With deadline scheduling you need to
|
| D | sched-design-CFS.rst | 121 scheduling modules are used. The balancing code got quite a bit simpler as a
126 5. Scheduling policies
129 CFS implements three scheduling policies:
131 - SCHED_NORMAL (traditionally called SCHED_OTHER): The scheduling
151 6. SCHEDULING CLASSES
154 The new CFS scheduler has been designed in such a way to introduce "Scheduling
156 encapsulate scheduling policy details and are handled by the scheduler core
166 Scheduling classes are implemented through the sched_class structure, which
175 It puts the scheduling entity (task) into the red-black tree and
181 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-capacity.rst | 2 Capacity Aware Scheduling
133 Capacity aware scheduling requires an expression of a task's requirements with
248 This means that while the capacity aware scheduling criteria will be written
252 3. Capacity aware scheduling requirements
269 As stated in 2.2, capacity-aware scheduling requires a frequency-invariant task
331 5. Capacity aware scheduling implementation
340 The main capacity scheduling criterion of CFS is::
370 Wakeup CPU selection in CFS can be eclipsed by Energy Aware Scheduling
406 the CPU capacity scheduling criterion is violated, and there may not be any more
427 CPUs can satisfy this capacity criterion, then strict priority based scheduling
|
| D | sched-ext.rst | 8 * sched_ext exports a full scheduling interface so that any scheduling
17 The default scheduling behavior is restored anytime an error is detected,
49 If a task explicitly sets its scheduling policy to ``SCHED_EXT``, it will be
214 Scheduling Cycle
224 binding. The actual decision is made at the last step of scheduling.
|
| 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_FULL 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
|
| /Documentation/block/ |
| D | ioprio.rst | 10 similar to what has been possible with cpu scheduling for ages. Support for io
14 Scheduling classes
17 Three generic scheduling classes are implemented for io priorities that
20 IOPRIO_CLASS_RT: This is the realtime io class. This scheduling class is given
29 IOPRIO_CLASS_BE: This is the best-effort scheduling class, which is the default
36 IOPRIO_CLASS_IDLE: This is the idle scheduling class, processes running at this
53 will run ls at the best-effort scheduling class at the highest priority.
58 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
|
| /Documentation/gpu/ |
| D | v3d.rst | 19 GPU Scheduling
22 :doc: Broadcom V3D scheduling
|
| /Documentation/virt/gunyah/ |
| D | index.rst | 23 - Scheduling:
26 of the CPUs. Gunyah supports two models of scheduling which can coexist on
29 1. Hypervisor vCPU scheduling in which Gunyah hypervisor schedules vCPUS on
31 2. "Proxy" scheduling in which an owner-VM can donate the remainder of its
|
| /Documentation/translations/zh_CN/ |
| D | glossary.rst | 18 * EAS: 能耗感知调度。（Energy Aware Scheduling）
|
| /Documentation/virt/geniezone/ |
| D | introduction.rst | 15 kernel for vCPU scheduling, memory management, inter-VM communication and virtio
28 CPUs. It requires Linux kernel in host VM for vCPU scheduling and VM power
|
| /Documentation/networking/ |
| D | napi.rst | 57 napi_schedule() is the basic method of scheduling a NAPI poll.
104 of calls. The poll method may be called without the driver scheduling
117 Scheduling and IRQ masking
120 Drivers should keep the interrupts masked after scheduling
|
| /Documentation/mm/ |
| D | numa.rst | 99 NUMA topology of the platform--embodied in the "scheduling domains" data
101 attempts to minimize task migration to distant scheduling domains. However,
114 privileged user can specify in the scheduling or NUMA commands and functions
|
| /Documentation/networking/devlink/ |
| D | octeontx2.rst | 41 - Use to set the quantum which hardware uses for scheduling among transmit queues.
|
| /Documentation/accounting/ |
| D | taskstats-struct.rst | 69 /* The scheduling discipline as set in task->policy field. */
70 __u8 ac_sched; /* Scheduling discipline */
|
| /Documentation/devicetree/bindings/soc/fsl/ |
| D | fsl,qman.yaml | 14 supports queuing and QoS scheduling of frames to CPUs, network interfaces and
|
| /Documentation/networking/device_drivers/ethernet/marvell/ |
| D | octeontx2.rst | 96 - SSO and TIM blocks config which provide packet scheduling support.
297 Hardware algorithms used in scheduling
302 levels. Each level contains an array of queues to support scheduling and shaping.
|
| /Documentation/ABI/testing/ |
| D | sysfs-platform-hidma-mgmt | 17 equal priority channels during round robin scheduling.
|
| /Documentation/tools/rtla/ |
| D | common_options.rst | 38 Set scheduling parameters to the osnoise tracer threads, the format to set the priority are:
|
1234