686 views
0 0 votes
OS:

Which process scheduling mechanism gives the optimal average waiting time and throughput, is it SJF or SRTF?

Which DISK scheduling algo gives the minimum seek time is it SSTF?

1 Answer

0 0 votes

usually it depends on what kind of requests are presents in queue.

but in std books like tanenbaum says sstf is provide better throughtput in respect of waiting time  than elevator algorithm.(general approach) 

bcoz in elevator algorithm if request is come behind the head it service that request only in  round trip.(huge wait)

even one question also ask in gate about it.(remember sstf and c-look algorithms are used as default case)

hope its helpful.

https://gateoverflow.in/1463/gate1999-1-10

Position:
Show:

Related questions

5 5 votes
1 1 answer
263
263 views
GO Classes asked Aug 31
263 views
Three processes $P_1$, $P_2$, and $P_3$ are scheduled using Round Robin.Assume:Each process has one kernel threadTime quantum $=\text{10 ms}$Context switch time $=\text{1...
6 6 votes
2 2 answers
286
286 views
GO Classes asked Jul 23
286 views
Match the following$$\begin{array}{ll}\text{I. FCFS} & \text{i. Optimal Waiting Time} \\\text{II. SJF} & \text{ii. Convoy effect} \\\text{III. Round Robin} & \text{iii. N...
3 3 votes
4 4 answers
235
235 views
GO Classes asked Jul 23
235 views
Consider the following five processes: $$\begin{array}{|c|c|c|c|}\hline\text{Process} & \text{Arrival Time} & \text{Burst Time} & \text{Priority} \\\hlineP_1 & 0 & 4 & 1 ...
6 6 votes
2 2 answers
282
282 views
GO Classes asked Jul 22
282 views
Which of the following statements about priority scheduling are correct?Priority scheduling can behave like SJF if the predicted CPU burst time is used as the priority. A...