Consider a disk sequence with 100 cylinders. The request to access the cylinder occur in the following sequence : 4, 34, 10, 7, 19, 73, 2, 15, 6, 20 Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 2 ms to move from one cylinder to adjacent one and shortest seek time first policy is
Consider a disk sequence with 100 cylinders. The request to access the cylinder occur in the following sequence : 4, 34, 10, 7, 19, 73, 2, 15, 6, 20 Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 2 ms to move from one cylinder to adjacent one and shortest seek time first policy is Correct Answer 238
Disk scheduling Algorithm: shortest seek time first
Disk queue request: 4, 34, 10, 7, 19, 73, 2, 15, 6, 20
Ascending order: 2, 4, 6, 7, 10, 15, 19, 20, 34, 73
one head movement takes 2 milliseconds.
Initial head is 50th cylinder
[ alt="F1 R.S. N.J. 17.09.2019 D1" src="//storage.googleapis.com/tb-img/production/19/09/F1_R.S._N.J._17.09.2019_D1.png" style="width: 308px; height: 161px;">
Calculation:
Total head movement = |50 – 2| + |2 – 73| = 48 +71 = 119
Total time = 119 × 2 = 238 milliseconds