GATE - 2001 | OS | Consider a set of n tasks with known runtimes r1, r2, ..., rn to be run on
Posted on 25-02-2022
GATE - 2001 [Operating System]
Questions:
Consider a set of n tasks with known runtimes r1, r2, ..., rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?
|
A |
Round-Robin |
|
B |
Shortest-Job-First |
|
C |
Highest-Response-Ratio-Next |
|
D |
First-Come-First-Served |
Solution:
Option (B) is Correct.
First we know what is throughput. It means total number of tasks executed per unit time.SJF executes shortest job very early so throughput increases in the case of SJF.
Thank You