A fair share scheduler computes the priority of a process based on which of the following?
(1) Processor utilization by the individual process.
(2) Weight assigned to the user/group.
(3) Processor utilization by the user/group.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. (1), (2) and (3)
Explanation
A fair-share scheduler aims to divide CPU time fairly among user groups rather than just among individual processes, so its priority formula has to account for how much CPU the individual process itself has used (1), the weight or share assigned to that process's user or group (2), and how much CPU the whole group has already consumed relative to its share (3). Omitting any one of these would break the fairness guarantee: for example ignoring group usage (3) would let a group running many processes starve other groups of equal weight. All three factors are therefore combined, making (1), (2) and (3), option (iii), correct.More System Software and Operating System questions
- Which of the following CPU scheduling algorithms may cause starvation of a process? (1) First-Come-First-Served (2) Round Robin (3) Priorit…
- A scheduling algorithm assigns a process's priority proportional to how long it has been waiting; every process starts at priority zero (th…
- At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operations and 'x' V operations were performed on th…
- At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operations and 'x' V operations were performed on th…
- Consider a system with five processes P0 through P4 and three resource types A, B and C, with 7, 2 and 6 total instances respectively. At t…
- The Bounded Buffer problem is also known as the ________.