Proportional share scheduling

This article needs additional citations for verification. Please help by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources:  –  ·  ·  · scholar · JSTOR (December 2009) (Learn how and when to remove this template 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[]

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

• v
• t