Searched full:scheduling (Results 1 – 25 of 1270) sorted by relevance
12345678910>>...51
| /kernel/linux/linux-5.10/net/netfilter/ipvs/ |
| D | Kconfig | 14 single IP address and scheduling them to real servers.
18 server via direct routing. The several scheduling algorithms can
115 tristate "round-robin scheduling"
117 The robin-robin scheduling algorithm simply directs network
124 tristate "weighted round-robin scheduling"
126 The weighted robin-robin scheduling algorithm directs network
137 tristate "least-connection scheduling"
139 The least-connection scheduling algorithm directs network
147 tristate "weighted least-connection scheduling"
149 The weighted least-connection scheduling algorithm directs network
[all …]
|
| D | ip_vs_wlc.c | 3 * IPVS: Weighted Least-Connection Scheduling module
10 * Wensong Zhang : changed to use the inactconns in scheduling
26 * Weighted Least Connection scheduling
35 IP_VS_DBG(6, "ip_vs_wlc_schedule(): Scheduling...\n"); in ip_vs_wlc_schedule()
|
| /kernel/linux/linux-4.19/Documentation/timers/ |
| D | NO_HZ.txt | 1 NO_HZ: Reducing Scheduling-Clock Ticks
5 reduce the number of scheduling-clock interrupts, thereby improving energy
10 There are three main ways of managing scheduling-clock interrupts
11 (also known as "scheduling-clock ticks" or simply "ticks"):
13 1. Never omit scheduling-clock ticks (CONFIG_HZ_PERIODIC=y or
17 2. Omit scheduling-clock ticks on idle CPUs (CONFIG_NO_HZ_IDLE=y or
21 3. Omit scheduling-clock ticks on CPUs that are either idle or that
31 NEVER OMIT SCHEDULING-CLOCK TICKS
34 are incapable of omitting scheduling-clock ticks. It turns out that
39 hundreds of microseconds). For these types of workloads, scheduling
[all …]
|
| /kernel/linux/linux-4.19/net/netfilter/ipvs/ |
| D | Kconfig | 13 single IP address and scheduling them to real servers.
17 server via direct routing. The several scheduling algorithms can
115 tristate "round-robin scheduling"
117 The robin-robin scheduling algorithm simply directs network
124 tristate "weighted round-robin scheduling"
126 The weighted robin-robin scheduling algorithm directs network
137 tristate "least-connection scheduling"
139 The least-connection scheduling algorithm directs network
147 tristate "weighted least-connection scheduling"
149 The weighted least-connection scheduling algorithm directs network
[all …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-4.19/Documentation/scheduler/ |
| D | sched-deadline.txt | 1 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.txt | 1 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.
171 The next project will be SCHED_EDF (Earliest Deadline First scheduling) to bring
172 full deadline scheduling to the linux kernel. Deadline scheduling the above
178 the limited static priority levels 0-99. With deadline scheduling you need to
|
| D | sched-design-CFS.txt | 110 scheduling modules are used. The balancing code got quite a bit simpler as a
115 5. Scheduling policies
117 CFS implements three scheduling policies:
119 - SCHED_NORMAL (traditionally called SCHED_OTHER): The scheduling
139 6. SCHEDULING CLASSES
141 The new CFS scheduler has been designed in such a way to introduce "Scheduling
143 encapsulate scheduling policy details and are handled by the scheduler core
153 Scheduling classes are implemented through the sched_class structure, which
162 It puts the scheduling entity (task) into the red-black tree and
168 corresponding scheduling entity out of the red-black tree. It decrements
[all …]
|
| D | 00-INDEX | 10 - information on scheduling domains.
14 - real-time group scheduling.
16 - deadline scheduling.
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-5.10/include/uapi/linux/sched/ |
| D | types.h | 15 * Extended scheduling parameters data structure.
28 * Scheduling Class Attributes
32 * scheduling policy and relative POSIX attributes:
36 * @sched_policy task's scheduling policy
40 * Certain more advanced scheduling features can be controlled by a
53 * - the maximum (or average, depending on the actual scheduling
69 * Given this task model, there are a multiplicity of scheduling algorithms
73 * As of now, the SCHED_DEADLINE policy (sched_dl scheduling class) is the
75 * available in the scheduling class file or in Documentation/.
|
| /kernel/liteos_a/kernel/include/ |
| D | los_task.h | 233 * Task error code: Only one task or no task is available for scheduling.
600 * the current task and task scheduling is not locked, it is scheduled for running.
649 …ty of the task resumed after system initialized is higher than the current task and task scheduling
685 …RRNO_TSK_SUSPEND_LOCKED The task being suspended is current task and task scheduling
715 …_ERRNO_TSK_DELETE_LOCKED The task being deleted is current task and task scheduling
735 …* <li>If 0 is passed in and the task scheduling is not locked, execute the next task in the queue …
737 …* If no ready task with the priority of the current task is available, the task scheduling will no…
746 …* @retval #LOS_ERRNO_TSK_DELAY_IN_LOCK The task delay occurs when the task scheduling …
748 …OS_ERRNO_TSK_YIELD_NOT_ENOUGH_TASK No tasks with the same priority is available for scheduling.
758 * @brief Lock the task scheduling.
[all …]
|
| /kernel/linux/linux-4.19/include/uapi/linux/sched/ |
| D | types.h | 14 * Extended scheduling parameters data structure.
27 * - the maximum (or average, depending on the actual scheduling
41 * @sched_policy task's scheduling policy
49 * Given this task model, there are a multiplicity of scheduling algorithms
53 * As of now, the SCHED_DEADLINE policy (sched_dl scheduling class) is the
55 * available in the scheduling class file or in Documentation/.
|
| /kernel/linux/linux-5.10/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.
|
| /kernel/linux/linux-4.19/Documentation/block/ |
| D | ioprio.txt | 11 scheduling for ages. This document mainly details the current possibilities
14 Scheduling classes
17 CFQ implements three generic scheduling classes that determine how io is
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.
|
| /kernel/linux/linux-4.19/tools/perf/Documentation/ |
| D | perf-sched.txt | 17 'perf sched record <command>' to record the scheduling events
20 'perf sched latency' to report the per task scheduling latencies
21 and other scheduling properties of the workload.
39 'perf sched timehist' provides an analysis of scheduling events.
47 task scheduling delay (time between wakeup and actually running) and run
123 Show only a summary of scheduling by thread with min, max, and average
128 Show all scheduling events followed by a summary by thread with min,
|
| /kernel/linux/linux-5.10/tools/perf/Documentation/ |
| D | perf-sched.txt | 17 'perf sched record <command>' to record the scheduling events
20 'perf sched latency' to report the per task scheduling latencies
21 and other scheduling properties of the workload.
39 'perf sched timehist' provides an analysis of scheduling events.
47 task scheduling delay (time between wakeup and actually running) and run
127 Show only a summary of scheduling by thread with min, max, and average
132 Show all scheduling events followed by a summary by thread with min,
|
| /kernel/linux/linux-5.10/net/sched/ |
| D | Kconfig | 46 comment "Queueing/Scheduling"
52 scheduling algorithm. This algorithm classifies the waiting packets
69 packet scheduling algorithm. See
83 (HFSC) packet scheduling algorithm.
124 packet scheduling algorithm.
135 packet scheduling algorithm.
146 packet scheduling algorithm.
157 scheduling algorithm. This queueing discipline allows the combination
169 scheduling algorithm.
180 scheduling algorithm.
[all …]
|
| /kernel/linux/linux-4.19/block/ |
| D | Kconfig.iosched | 13 that do their own scheduling and require only minimal assistance from
37 bool "CFQ Group Scheduling support"
41 Enable group IO scheduling in CFQ.
95 bool "BFQ hierarchical scheduling support"
100 Enable hierarchical scheduling in BFQ, using the blkio
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/amd/include/ |
| D | kgd_kfd_interface.h | 91 * @KFD_SCHED_POLICY_HWS: H/W scheduling policy known as command processor (cp)
92 * scheduling. In this scheduling mode we're using the firmware code to
98 * in this scheduling mode user mode queues over subscription feature is
104 * @KFD_SCHED_POLICY_NO_HWS: no H/W scheduling policy is a mode which directly
176 * This function is used only for no cp scheduling mode.
179 * scheduling mode. Only used for no cp scheduling mode.
203 * Only used for no cp scheduling mode
|
| /kernel/linux/linux-4.19/net/sched/ |
| D | Kconfig | 45 comment "Queueing/Scheduling"
51 scheduling algorithm. This algorithm classifies the waiting packets
68 packet scheduling algorithm. See
82 (HFSC) packet scheduling algorithm.
123 packet scheduling algorithm.
134 packet scheduling algorithm.
145 packet scheduling algorithm.
156 scheduling algorithm. This queueing discipline allows the combination
168 scheduling algorithm.
179 scheduling algorithm.
[all …]
|
| /kernel/linux/linux-5.10/drivers/net/ethernet/chelsio/cxgb4/ |
| D | sched.c | 87 * value (TX Scheduling Class in this case). in t4_sched_bind_unbind_op()
387 * cxgb4_sched_class_bind - Bind an entity to a scheduling class
392 * Binds an entity (queue) to a scheduling class. If the entity
436 * cxgb4_sched_class_unbind - Unbind an entity from a scheduling class
441 * Unbinds an entity (queue) from a scheduling class.
496 /* Look for a class with matching scheduling parameters */ in t4_sched_class_lookup()
573 * cxgb4_sched_class_alloc - allocate a scheduling class
575 * @p: new scheduling class to create.
577 * Returns pointer to the scheduling class created. If @p is NULL, then
578 * it allocates and returns any available unused scheduling class. If a
[all …]
|
| /kernel/linux/linux-4.19/drivers/net/ethernet/chelsio/cxgb4/ |
| D | sched.c | 87 * value (TX Scheduling Class in this case). in t4_sched_bind_unbind_op()
286 * cxgb4_sched_class_bind - Bind an entity to a scheduling class
291 * Binds an entity (queue) to a scheduling class. If the entity
335 * cxgb4_sched_class_unbind - Unbind an entity from a scheduling class
340 * Unbinds an entity (queue) from a scheduling class.
396 /* Look for a class with matching scheduling parameters */ in t4_sched_class_lookup()
480 * cxgb4_sched_class_alloc - allocate a scheduling class
482 * @p: new scheduling class to create.
484 * Returns pointer to the scheduling class created. If @p is NULL, then
485 * it allocates and returns any available unused scheduling class. If a
[all …]
|
12345678910>>...51