| /linux/net/netfilter/ipvs/ |
| H A D | Kconfig | 14 single IP address and scheduling them to real servers.
18 server via direct routing. The several scheduling algorithms can
116 tristate "round-robin scheduling"
118 The robin-robin scheduling algorithm simply directs network
125 tristate "weighted round-robin scheduling"
127 The weighted robin-robin scheduling algorithm directs network
138 tristate "least-connection scheduling"
140 The least-connection scheduling algorithm directs network
148 tristate "weighted least-connection scheduling"
150 The weighted least-connection scheduling algorithm directs network
[all …]
|
| H A 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()
|
| H A D | ip_vs_nq.c | 3 * IPVS: Never Queue scheduling module
15 * Expected Delay scheduling algorithm).
50 * Weighted Least Connection scheduling
59 IP_VS_DBG(6, "%s(): Scheduling...\n", __func__); in ip_vs_nq_schedule()
|
| H A D | ip_vs_sed.c | 3 * IPVS: Shortest Expected Delay scheduling module
28 * WLC, while scheduling big jobs under larger heterogeneous systems
54 * Weighted Least Connection scheduling
63 IP_VS_DBG(6, "%s(): Scheduling...\n", __func__); in ip_vs_sed_schedule()
|
| H A D | ip_vs_lc.c | 3 * IPVS: Least-Connection Scheduling module
21 * Least Connection scheduling
30 IP_VS_DBG(6, "%s(): Scheduling...\n", __func__); in ip_vs_lc_schedule()
|
| H A D | ip_vs_ovf.c | 3 * IPVS: Overflow-Connection Scheduling module
23 /* OVF Connection scheduling */
31 IP_VS_DBG(6, "ip_vs_ovf_schedule(): Scheduling...\n"); in ip_vs_ovf_schedule()
|
| H A D | ip_vs_wrr.c | 3 * IPVS: Weighted Round-Robin Scheduling module
58 * current destination pointer for weighted round-robin scheduling
111 * Allocate the mark variable for WRR scheduling in ip_vs_wrr_init_svc()
157 * Weighted Round-Robin Scheduling
167 IP_VS_DBG(6, "%s(): Scheduling...\n", __func__); in ip_vs_wrr_schedule()
|
| /linux/Documentation/timers/ |
| H A 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 …]
|
| /linux/Documentation/admin-guide/hw-vuln/ |
| H A 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 …]
|
| /linux/tools/verification/models/sched/ |
| H A D | sts.dot | 11 {node [shape = circle] "scheduling"};
16 "can_sched" -> "scheduling" [ label = "schedule_entry" ];
29 "in_irq" -> "scheduling" [ label = "irq_enable" ];
30 "scheduling" [label = "scheduling"];
31 "scheduling" -> "disable_to_switch" [ label = "irq_disable" ];
|
| /linux/include/uapi/linux/sched/ |
| H A D | types.h | 11 * Extended scheduling parameters data structure.
24 * Scheduling Class Attributes
28 * scheduling policy and relative POSIX attributes:
32 * @sched_policy task's scheduling policy
36 * Certain more advanced scheduling features can be controlled by a
49 * - the maximum (or average, depending on the actual scheduling
65 * Given this task model, there are a multiplicity of scheduling algorithms
69 * As of now, the SCHED_DEADLINE policy (sched_dl scheduling class) is the
71 * available in the scheduling class file or in Documentation/.
|
| /linux/Documentation/netlink/specs/ |
| H A D | net_shaper.yaml | 10 arbitrary manipulation of the scheduling tree of the involved
18 scheduling group, that can be placed in an arbitrary location of
19 the scheduling tree.
23 the @group operation, to create and update a scheduling
31 support for complex scheduling hierarchy, or for some shaping
58 in any location of the scheduling tree, except
104 Scheduling priority for the given shaper. The priority
105 scheduling is applied to sibling shapers.
110 Relative weight for round robin scheduling of the
112 The scheduling is applied to all sibling shapers
[all …]
|
| /linux/Documentation/scheduler/ |
| H A 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
124 Real-time group scheduling means you have to assign a portion of total CPU
156 There is work in progress to make the scheduling period for each group
161 as its prone to starvation without deadline scheduling.
178 The next project will be SCHED_EDF (Earliest Deadline First scheduling) to bring
179 full deadline scheduling to the linux kernel. Deadline scheduling the above
185 the limited static priority levels 0-99. With deadline scheduling you need to
|
| H A 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
|
| /linux/Documentation/block/ |
| H A 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.
|
| /linux/kernel/ |
| H A D | Kconfig.preempt | 33 raw processing power of the kernel, irrespective of scheduling
149 bool "Core Scheduling for SMT"
152 This option permits Core Scheduling, a means of coordinated task
167 bool "Extensible Scheduling Class"
172 allows scheduling policies to be implemented as BPF programs to
176 iteration of new scheduling policies.
181 scheduling policies in production environments.
185 wish to implement scheduling policies. The struct_ops structure
|
| /linux/net/sched/ |
| H A D | Kconfig | 46 comment "Queueing/Scheduling"
52 packet scheduling algorithm. See
66 (HFSC) packet scheduling algorithm.
93 packet scheduling algorithm.
104 packet scheduling algorithm.
115 packet scheduling algorithm.
126 scheduling algorithm. This queueing discipline allows the combination
138 scheduling algorithm.
149 scheduling algorithm.
160 scheduling algorithm.
[all …]
|
| /linux/tools/perf/pmu-events/arch/arm64/arm/cortex-a65-e1/ |
| H A D | ifu.json | 69 "PublicDescription": "This thread and the other thread both ready for scheduling in if0",
72 "BriefDescription": "This thread and the other thread both ready for scheduling in if0"
75 …blicDescription": "This thread was arbitrated when the other thread was also ready for scheduling",
78 …BriefDescription": "This thread was arbitrated when the other thread was also ready for scheduling"
87 …ription": "This thread was not arbitrated because it was not ready for scheduling. For example, du…
90 …"BriefDescription": "This thread was not arbitrated because it was not ready for scheduling. For e…
|
| /linux/Documentation/arch/x86/ |
| H A D | amd-hfi.rst | 4 Hardware Feedback Interface For Hetero Core Scheduling On AMD Platform
21 as well. The purpose of the scheduling feedback mechanism is to provide
49 special scheduling behaviors. The below table depicts an example of thread
58 | class ID | Classification | Preferred scheduling behavior | Preemption priority | Counter |
100 The implementation of threads scheduling consists of the following steps:
103 heterogeneous scheduling policy.
114 scheduling the thread on its ideal processor (if available).
133 consume data for scheduling decisions.
|
| /linux/drivers/net/ethernet/chelsio/cxgb4/ |
| H A 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 …]
|
| /linux/drivers/accel/ivpu/ |
| H A D | vpu_jsm_api.h | 38 * Number of Priority Bands for Hardware Scheduling
159 * For HWS command queue scheduling, we can prioritise command queues inside the
167 * For HWS priority scheduling, we can have multiple realtime priority bands.
213 * Job scheduling priority bands for both hardware scheduling and OS scheduling.
477 * aborted and removed from internal scheduling queues. All doorbells assigned
513 /** Control command: Set context scheduling properties */
620 /** Response to control command: Set context scheduling properties */
675 * This structure supports doorbell registration for only OS scheduling.
693 * Request structure to unregister a doorbell for both HW and OS scheduling.
892 * and HW scheduling.
[all …]
|
| /linux/kernel/sched/ |
| H A D | ext_internal.h | 262 * A BPF scheduler can implement an arbitrary scheduling policy by
264 * scheduling policy can also be implemented using the BPF scheduler
316 * the task while updating its scheduling properties (e.g. priority).
321 * on the scheduling logic, this can lead to confusing behaviors - e.g.
322 * scheduling position not being updated across a priority change.
464 * Documentation/admin-guide/hw-vuln/core-scheduling.rst for details on
541 * @p: task to initialize for BPF scheduling
545 * Initialize @p for BPF scheduling. This operation may block and can
565 * @enable: Enable BPF scheduling for a task
566 * @p: task to enable BPF scheduling for
[all …]
|
| H A D | stop_task.c | 3 * stop-task scheduling class.
67 * scheduler tick hitting a task of our scheduling class.
94 * Simple, special scheduling class for the per-CPU stop tasks:
|
| /linux/drivers/gpu/drm/xe/ |
| H A D | xe_hw_engine_types.h | 73 * @sched_props: scheduling properties
74 * @defaults: default scheduling properties
78 * @sched_props: scheduling properties
79 * @defaults: default scheduling properties
|
| /linux/tools/sched_ext/ |
| H A D | scx_central.bpf.c | 5 * a. Making all scheduling decisions from one CPU:
7 * The central CPU is the only one making scheduling decisions. All other
37 * SCX_KICK_PREEMPT is used to trigger scheduling and CPUs to move to the
41 * more practical implementation would likely put the scheduling loop outside
231 * Force dispatch on the scheduling CPU so that it finds a task in BPF_STRUCT_OPS()
343 * We are offloading all scheduling decisions to the central CPU
|