edited by
11,044 views
29 votes
29 votes

Which of the following disk scheduling strategies is likely to give the best throughput?

  1. Farthest cylinder next

  2. Nearest cylinder next

  3. First come first served

  4. Elevator algorithm

edited by

6 Answers

Best answer
42 votes
42 votes
  1. Farthest cylinder next $\rightarrow$ This might be candidate for worst algorithm . This is false.
  2. Nearest cylinder next $\rightarrow$ This is output.
  3. First come first served $\rightarrow$ This will not give best throughput. It is random .
  4. Elevator algorithm $\rightarrow$ This is good but issue is that once direction is fixed we don't come back, until we go all the other way. So it does not give best throughput.

Correct Answer: $B$

edited by
11 votes
11 votes
Nearest cylinder next . in this many pages can be accessed in less time  . So throughput will be high .
5 votes
5 votes

The only catch in the question is that they are asking for the most likely to give the best throughput.

Even if for some cases SCAN can have better results but the most likely to result the best throughput is Nearest cylinder Algo ;)

Answer:

Related questions

36 votes
36 votes
3 answers
1
Kathleen asked Sep 23, 2014
12,637 views
A multi-user, multi-processing operating system cannot be implemented on hardware that does not supportAddress translationDMA for disk transferAt least two modes of CPU e...
25 votes
25 votes
2 answers
2
Kathleen asked Sep 23, 2014
11,932 views
System calls are usually invoked by usinga software interruptpollingan indirect jumpa privileged instruction
21 votes
21 votes
6 answers
4