GATE CSE 2016 Set 1 | Question: 20

Question

Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?

• A. Shortest remaining time first
• B. Round-robin with the time quantum less than the shortest CPU burst 
• C. Uniform random
• D. Highest priority first with priority proportional to CPU burst length

Comments

Which process scheduling alogrithm will take max avg waiting time?

---

For max average waiting time, we can not say for sure because it would depend on the input. But minimum is always guaranteed by SJF and SRTF.

---

Why isnt it Round-Robin? Cuz srtf may cause starvation isnt it? And with burst time, every process will get a chance to execute.

---

What we consider if srtf and round robin only two present ?

Answer 1

Answer should be (A) SRTF
SJF minimizes average waiting time. Probably optimal.
Now, here as all processes arrive at the same time, SRTF would be same as SJF. and hence, the answer.

Reference: http://www.cs.columbia.edu/~junfeng/10sp-w4118/lectures/l13-sched.pdf See Slide 16,17 and 23

Comments

abhilashpanicker29 That's not "probably" — that's provably, ie, it can be proved.

---

@abhilashpanicker29 Why not Round Robin?

---

@Shivani Shukla 
Don’t confuse waiting time with response time waiting time will always be minimum in case of SJF 

Answer 2

Turnaround time is the total time taken by the process between starting and the completion and waiting time is the time for which process is ready to run but not executed by CPU scheduler. As we know, in all CPU Scheduling algorithms, shortest job first is optimal i.ie. it gives minimum turn round time, minimum average waiting time and high throughput and the most important thing is that shortest remaining time first is the pre-emptive version of shortest job first. shortest remaining time first scheduling algorithm may lead to starvation because If the short processes are added to the cpu scheduler continuously then the currently running process will never be able to execute as they will get pre-empted but here all the processes are arrived at same time so there will be no issue such as starvation. So, the answer is Shortest remaining time first, which is answer (A).

Answer 3

Ans should be srtf but because in srtf their may be possibility of starvation so answer is round robin.

Comments

Sjf will minimum average waiting time .  when all jobs submitted at the same time SJF and SRTF same .

---

Question asked was about average waiting time.. And SRTF is the answer..
http://www.cs.columbia.edu/~junfeng/10sp-w4118/lectures/l13-sched.pdf

Answer 4

B .because fair kind of decision is made by round robbin as it pre empts  the executing process when a slot/ quantum expires.

Comments

read the question once again