Share to:

Proportional share scheduling

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Proportional share scheduling" – news · newspapers · books · scholar · JSTOR (December 2009) (Learn how and when to remove this message)

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

^ http://pages.cs.wisc.edu/~remzi/OSFEP/cpu-sched-lottery.pdf ^{[bare URL PDF]}

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

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

Kembali kehalaman sebelumnya