edited by
11,052 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

1 votes
1 votes
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
–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

36 votes
36 votes
3 answers
1
Kathleen asked Sep 23, 2014
12,646 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,944 views
System calls are usually invoked by usinga software interruptpollingan indirect jumpa privileged instruction
21 votes
21 votes
6 answers
4