Question

Discuss the potential advantages and disadvantages of “Fair-Share Scheduling”.

Answer 1

Fair Share Scheduling algorithm was first designed at Sydney University by Judy Kay Piers Lauder in 1980 .  The Round Robin Algorithm is an example of Fair Share Scheduling algorithm . In Round Robin Algorithm a quantum amount is fixed which is given to each process in the queue for execution .

Advantages of Fair - Share Scheduling are

1. No biasing . All processes got equal amount of time for execution .

2. A big advantage of Fair - Share Schedulng over the non-preemptive schedulers is that Fair - share scheduling improves the average response times.

3. It limits the starvation condition.

4. It is easy to implement .

Disadvantages of Fair - Share Scheduling are

1. In real time scenario , most times we have to give priority for a particular process or user . In that case Fair Share scheduling is not good .

2. Setting the Fair Criteria is complex task . E.g. in case of round robin technique , choosing the right quantum is not so easy . If we choose quantum too large , then it becomes First come first serve algorithm . If we choose less quantum time , then more time waste goes for context switching leads to less efficiency .