Proportional share scheduling
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
- 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
- Processor affinity
- Starvation
 | This computer science article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e
