GATE - 1999 | OS | Which of the following disk scheduling strategies is likely to give the
Posted on 27-02-2022
GATE - 1999 [Operating System]
Questions:
Which of the following disk scheduling strategies is likely to give the best through put?
|
A |
Farthest cylinder next |
|
B |
Nearest cylinder next |
|
C |
First come first served |
|
D |
Elevator algorithm |
Solution:
Option (B) is Correct.
Farthest cylinder next - Longest job first
Nearest cylinder next - SSTF
First come first served - FCFS
Elevator - SCAN
SSTF always serves the request of nearest cylinder first. Due to which the necessary movement gets reduced.
Thank You