GATE | GATE CS 1999 | Question 10
Which of the following disk strategies is likely to give the best throughput?
(A) Farthest cylinder next
(B) Nearest cylinder next
(C) First come first served
(D) Elevator algorithm
Explanation: Nearest cylinder next is also known as shortest seek time first and in this algorithm many pages can be accessed in less amount of time.
So throughput will be high so this is optimal algorithm.
Option (B) is correct.
Quiz of this Question