Fair Share Scheduling Algorithm

July 8, 2014July 25, 2017 WFQ 0 Comments algo, algorithm, CPU, Fair, Fair Share, Fair Share Scheduling, Fair Share Scheduling Algorithm, Fair Share Threads, Fixed Priority, operating system, priority, priority class, Scheduling, scheduling algorithm, share, Solaris 9

Q1. Explain Fair Share Scheduling.

Ans. Solaris 9 introduced two new classes of scheduling:

Fixed Priority
Fair Share

Threads in fixed priority class have the same priority range as in time sharing system.

Fair Share Scheduling class uses CPU share instead of priorities to make scheduling decisions. CPU share indicates right to available CPU resources and are allocated to a set of processes (known as project).

Share this:

Like this:

Related

Leave a Reply Cancel reply