Home
last modified time | relevance | path

Searched full:fair (Results 1 – 25 of 115) sorted by relevance

12345

/Linux-v5.15/net/sched/
DKconfig7 bool "QoS and/or fair queueing"
80 tristate "Hierarchical Fair Service Curve (HFSC)"
82 Say Y here if you want to use the Hierarchical Fair Service Curve
132 tristate "Stochastic Fair Blue (SFB)"
134 Say Y here if you want to use the Stochastic Fair Blue (SFB)
291 tristate "Quick Fair Queueing scheduler (QFQ)"
293 Say Y here if you want to use the Quick Fair Queueing Scheduler (QFQ)
313 tristate "Fair Queue Controlled Delay AQM (FQ_CODEL)"
335 tristate "Fair Queue"
463 bool "Fair Queue" if NET_SCH_FQ
[all …]
Dsch_fq_codel.c3 * Fair Queue CoDel discipline
26 /* Fair Queue CoDel.
732 MODULE_DESCRIPTION("Fair Queue CoDel discipline");
Dsch_choke.c21 CHOKe stateless AQM for fair bandwidth allocation
37 Active Queue Management Scheme for Approximating Fair Bandwidth Allocation",
/Linux-v5.15/Documentation/scheduler/
Dsched-design-CFS.rst9 CFS stands for "Completely Fair Scheduler," and is the new "desktop" process
152 sched/fair.c implements the CFS scheduler described above.
209 fair CPU time to each task. Sometimes, it may be desirable to group tasks and
210 provide fair CPU time to each such task group. For example, it may be
211 desirable to first provide fair CPU time to each user on the system and then to
/Linux-v5.15/net/dccp/ccids/
DKconfig20 be reasonably fair when competing for bandwidth with TCP-like flows,
21 where a flow is "reasonably fair" if its sending rate is generally
/Linux-v5.15/arch/x86/include/asm/
Dspinlock.h19 * These are fair FIFO ticket locks, which support up to 2^16 CPUs.
Dqspinlock.h94 * back to a Test-and-Set spinlock, because fair locks have in virt_spin_lock()
/Linux-v5.15/Documentation/ABI/testing/
Dsysfs-class-bdi49 be trusted to play fair.
/Linux-v5.15/fs/reiserfs/
DREADME40 fair, ask. (Last I spoke with him Richard was contemplating how best
41 to address the fair crediting issue in the next GPL version.)
/Linux-v5.15/kernel/locking/
Drwbase_rt.c29 * locks on RT are not writer fair, but writers, which should be avoided in
33 * It's possible to make the rw primitives writer fair by keeping a list of
Dmcs_spinlock.h8 * with the desirable properties of being fair, and with each cpu trying
/Linux-v5.15/kernel/sched/
DMakefile26 obj-y += idle.o fair.o rt.o deadline.o
/Linux-v5.15/include/net/
Dfq.h59 * struct fq - main container for fair queuing purposes
/Linux-v5.15/tools/include/linux/
Dring_buffer.h41 * supported architectures since for a fair number it would
/Linux-v5.15/Documentation/process/
Dcode-of-conduct.rst45 and are expected to take appropriate and fair corrective action in response to
/Linux-v5.15/drivers/thermal/
DKconfig130 bool "Fair-share thermal governor"
132 Enable this to manage platform thermals using fair-share governor.
/Linux-v5.15/Documentation/driver-api/
Dbasics.rst30 .. kernel-doc:: kernel/sched/fair.c
/Linux-v5.15/include/asm-generic/
Dqrwlock.h93 /* Optimize for the unfair lock case where the fair flag is 0. */ in queued_write_lock()
/Linux-v5.15/net/ipv4/
DKconfig517 based on network conditions and in a way so as to be fair with
580 ``fair share`` of bandwidth as targeted by TCP.
670 ("Fair Queue") pacing packet scheduler.
/Linux-v5.15/mm/
DKconfig.debug60 a fair amount of memory if enabled. See tools/vm/page_owner_sort.c
/Linux-v5.15/Documentation/locking/
Dmutex-design.rst53 with the desirable properties of being fair and with each cpu trying
Dpi-futex.rst53 apps have a very fair expectation of being able to use locks, we've got
/Linux-v5.15/Documentation/core-api/
Dgenalloc.rst101 naturally, write a special-purpose algorithm, but there is a fair set
/Linux-v5.15/LICENSES/dual/
DCC-BY-4.0113 e. Exceptions and Limitations means fair use, fair dealing, and/or
/Linux-v5.15/Documentation/block/
Dbfq-iosched.rst2 BFQ (Budget Fair Queueing)
214 applications more than their fair share of the device
244 perfectly fair, and smooth service. In particular, B-WF2Q+

12345