12,810 views
21 votes
21 votes

Consider a set of n tasks with known runtimes $r_1, r_2, \dots 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. Shortest job first
  3. Highest response ratio next
  4. first come first served

6 Answers

Best answer
42 votes
42 votes

Answer :  Shortest job first

Throughput means total number of tasks executed per unit time. Shortest Job First has maximum throughput because in this scheduling technique shortest jobs are executed first hence maximum number of tasks are completed.
Note: Highest-Response-Ratio-Next policy favors shorter jobs, but it also limits the waiting time of longer jobs.

selected by
16 votes
16 votes
ans is B.

SJF serves all the shorter processes first therefore number of processes completed in some time interval will be more in SJF than any other.
10 votes
10 votes

Throughput means total number of tasks executed per unit time.
Shortest Job First has maximum throughput because in this scheduling technique shortest jobs are executed first hence maximum number of tasks are completed.
Highest-Response-Ratio-Next policy favors shorter jobs, but it also limits the waiting time of longer jobs.

3 votes
3 votes

In Round Robin if Time quantum is less, More number of processes are present and  All processes burst times are high than TQ then throughput decreases because all processes execute for TQ and wait in queue

In HRRN It favors shorter jobs but limit waiting time of longer processes

In FIFO if longer jobs arrived first then its Throughput decreases

In SJF smaller processes will execute first, it cause starvation of longer processes but compared to other scheduling algorithms SJF  results maximum throughput.

So Answer is SJF

Answer:

Related questions

8 votes
8 votes
3 answers
1
go_editor asked Jun 10, 2016
4,647 views
Feedback queuesare very simple to implementdispatch tasks according to execution characteristicsare used to favour real time tasksrequire manual intervention to implement...
8 votes
8 votes
2 answers
2
go_editor asked Jun 10, 2016
7,756 views
On a system using non-preemptive scheduling, processes with expected run times of 5, 18, 9 and 12 are in the ready queue. In what order should they be run to minimize wai...
5 votes
5 votes
1 answer
3
go_editor asked Jun 10, 2016
3,094 views
Round Robin schedule is essentially the pre-emptive version ofFIFOShortest job firstShortest remaining timeLongest remaining time
5 votes
5 votes
3 answers
4