# GATE1999-1.10

24 votes
5.3k views

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
1
what is Farthest cylinder next algorithm
1

Option (B) and (D) both are acceptable. For more details please check comment of @Vicky rix ji.

0
As throughput is asked can it be interpreted as at any point of time during disk scheduling which Algo gives max request processing per second. Which implies minimum head movements.
0

@tusharp It should be minimum head movements not maximum as overall seek latency is minimum when head movements are minimum thus maximum throughput.

## 6 Answers

33 votes

Best answer
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
5
I am confused between nearest cylinder next or elevator?? Because both gives good throughput. what should be the answer?? and why?? why it shouldnt be elevator since it doesnt even have starvation problem??
1
How to decide between nearest cylinder and elevator algo.
0
Option B is like SSTF ...
0

Hi @sushmitavaishali jhalani and Puja Mishra ji,

First of all thanks for raising good point. But could you please provide some counter example where Elevator algorithm will perform better then Nearest cylinder next ?

5
In nearest cylinder next, we cant fix the direction in which go next

but in Elevator , first we fix the diection then go only that direction and then come back to opposite direction

like if we have 10,50 request and head is on 20

then nearest cylinder next , 20->10->50   total seek time 10+40=50

elevator 20->50->10  total seek time=30+40=70 ( direction is fix toward 50)
17

As long as the block request string is given, we cannot decide between B) and D)

B) is not always the best EX:

3

throughput put depends on the number of requests served per second  as we always go for the shortest reach SSTF Does this best as it tries to serve the maximum number of processes in less time

2

Thank you @Vicky rix ji.

4
Scan is called elevator algorithm ...
0

For more reference go to this question.

https://gateoverflow.in/8227/gate2015-1-30

How SCAN Algo hear move one side head and then return.

4
It should be Elevator algorithm since it provides more uniform waiting time than the SSTF or nearest cylinder next algorithm.
2

Both B AND D are correct.

D is also correct(see @Vicky rix comment ) and as it's a GATE 1999 question multiple options are possible as answers.

1

I dont think there can be 2 correct answers for this as it is asking for the BEST, how can two strategies be best simultaneously. What to write if it appears in the exam now…. Other sites like GFG have also given B

11 votes
Option B

Nearest cylinder next but it can lead to starvation
9 votes
Nearest cylinder next . in this many pages can be accessed in less time  . So throughput will be high .
3 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 ;)

1 vote
A- Like always choose more distance from itself , so it can't be answer

B- its SSTF

C- its FCFS

D-Its SCAN

> FCFS throughput is less then SSTF so it's also not answer

> now the fight b//w SSTF and SCAN

SSTF always serve nearest cylinder first , so necessary movements gets reduced . and in case of SCAN it goes to one end and come back ,which takes more time to complete task , so SSTF throughput is best .
–4 votes
D.

Both the Nearest Cylinder and Elevator are high on throughput.But I will go with ELEVATOR.

Reason:

Nearest Cylinder Next algo will have a overhead of computing the nearest cylinders of the queue.
Answer:

## Related questions

26 votes
3 answers
1
6.9k views
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support Address translation DMA for disk transfer At least two modes of CPU execution (privileged and non-privileged) Demand paging
19 votes
2 answers
2
7.2k views
System calls are usually invoked by using a software interrupt polling an indirect jump a privileged instruction
4 votes
4 answers
3
1.2k views
Consider the following solution to the producer-consumer problem using a buffer of size 1. Assume that the initial value of count is 0. Also assume that the testing of count and assignment to count are atomic operations. Producer: Repeat Produce an item; if count = ... Producer); Consume item; Forever; Show that in this solution it is possible that both the processes are sleeping at the same time.
19 votes
6 answers
4
2.1k views
A certain processor provides a 'test and set' instruction that is used as follows: TSET register, flag This instruction atomically copies flag to register and sets flag to $1$. Give pseudo-code for implementing the entry and exit code to a critical region using this instruction.