The Gateway to Computer Science Excellence
0 votes
102 views
Consider a set of n tasks with known runtimes 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
closed as a duplicate of: ISRO2007-11, GATE2001-1.19
in Operating System by (45 points)
closed by | 102 views
0
what do you mean by throughput?
+1
No. of process completes in per unit of time

1 Answer

+1 vote
Best answer

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.

by Boss (15.4k points)
selected by
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,382 answers
198,530 comments
105,323 users