395 views
0 votes
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 votes
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

Related questions

0 votes
0 votes
0 answers
1
roopkathaaa asked Aug 30, 2023
362 views
Let the base priority of a system be 130 and the nice value provided is -10. What is the time slice that the process gets in the O(1) scheduling algorithm?if it should be...
1 votes
1 votes
1 answer
2
FaisalSyed asked Mar 16, 2023
296 views
Does Waiting Time and Response TIme remains the same in Preemptive Scheduling Algorithm???
2 votes
2 votes
4 answers
4
go_editor asked Mar 24, 2020
4,524 views
Which of the following scheduling algorithms may cause starvation ?First-come-first-servedRound RobinPriorityShortest process nextShortest remaining time first a, c and e...