Consider a set of n tasks with known runtimes [Tex]r_1, r_2, \ldots, r_n[/Tex]…
2001
Consider a set of n tasks with known runtimes [Tex]r_1, r_2, \ldots, r_n[/Tex] 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 79 students.
Show answer & explanation
Correct answer: B
The correct answer is Option B (Shortest Job First). When all task runtimes are known, scheduling shorter jobs first completes more tasks earlier and minimizes average waiting time and average turnaround time. Round Robin is aimed at fairness and response time, FCFS can suffer from the convoy effect, and HRRN is a compromise that accounts for aging. Therefore, among the given policies, SJF gives the best throughput behavior for this batch of known runtimes.