Question: Consider a disk system with 1 0 0 cylinders. The requests to access the cylinders occur in following sequence: 4 , 3 4 , 1

Consider a disk system with 100 cylinders. The requests to access the cylinders occur in 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 1ms to move from one cylinder to adjacent one and shortest seek time first policy is used?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!