Proportional share scheduling explained

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.

Notes and References

  1. http://pages.cs.wisc.edu/~remzi/OSFEP/cpu-sched-lottery.pdf