Consider a set of n tasks with known runtimes r1, r2 .... rn to be run on a…
2001
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
Attempted by 194 students.
Show answer & explanation
Correct answer: B
Shortest-Job-First scheduling maximizes throughput by executing the quickest tasks first. This approach minimizes average waiting time and allows more processes to complete within a specific duration compared to FCFS or Round-Robin.
A video solution is available for this question — log in and enroll to watch it.