12,806 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

1 votes
1 votes

The answer will be SJF(Shortest Job First) scheduling

SJF has maximum throughput

Throughput means no. of process completes in per unit of time.

 Among all CPU Scheduling algorithms, shortest job first is optimal . It gives minimum turn round time, minimum average waiting time and high throughput .

However, SJF can lead to starvation.

0 votes
0 votes

I have a different opinion on this old question : According to me, answer is B and D.

Let me make my points : 

Throughput = #processes executed per unit time. If context switch time = 0; then no matter what algorithm you use, throughput is going to be same. Now, if CS time matters, throughput will be higher in non-preemptive algorithms.(as less #CS will happen here). So that rules out HRRN and RR as you may have more CS resulting in more time to complete all the n tasks, thus low throughput compared to non-preemptive algorithms.

But, the rest 2 are non-preemptive : SJF and FCFS. Take any example and draw the gnatt for it, your end time will always be the same as #CS are same. Thus throughput will be same in all non-preemptive algorithms : (CT of last process – AT of first process) / n ; 

 

Answer:

Related questions

8 votes
8 votes
3 answers
1
go_editor asked Jun 10, 2016
4,646 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,753 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