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 algorithm…
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 algorithm will result in the maximum throughput.
Show answerHide answer
Correct answer: (D) Shortest job first
Explanation
Shortest Job First runs the shortest tasks first, so the average waiting time is minimised and the most jobs are completed per unit time.