Proportional share scheduling

Last updated April 21, 2025

Proportional share scheduling is a type of scheduling that preallocates certain amount of CPU time to each of the processes.^[1] In a proportional share algorithm every job has a weight, and jobs receive a share of the available resources proportional to the weight of every job.

References

↑ "Scheduling: Proportional Share" (PDF). pages.cs.wisc.edu.

This computer science article is a stub. You can help Wikipedia by expanding it.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] "Scheduling: Proportional Share" (PDF). pages.cs.wisc.edu.

[1]

v t e Processor scheduling
Algorithms	Deadline-monotonic Earliest deadline Earliest eligible virtual deadline first Fair-share Fixed-priority pre-emptive Foreground-background Gang Generalized foreground-background Highest response ratio next Lottery Multilevel feedback queue Process Contention Scope Proportional share Rate-monotonic Round-robin Shortest job next Shortest remaining time Statistical time-division multiplexing Stride Two-level Windows NT YDS algorithm
Linux	Brain Fuck Completely Fair O(1) O(n) SCHED DEADLINE SCHED FIFO SCHED NORMAL
Other	Processor affinity Starvation