Consider a set of n tasks with known runtimes r1, r2, ...rn

Home » Operating Systems » Operating systems miscellaneous » Question

Consider a set of n tasks with known runtimes r₁, r₂, ...r_n to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?

1. Round Robin
2. Shortes Jobs First
3. Highest Response Ratio Next
4. First Come First Served

Correct Option: B

Here the running times r₁ to r_n are already known, single processor system. In this scenario, throughput i.e. CPU is maximum utilized in shortest job first scheduling.