Jump to content

Proportional share scheduling

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Rofraja (talk | contribs) at 13:34, 20 April 2025 (Fix bare URLs references, add title). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

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