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 cylinders. The requests to access the cylinders occur in following sequence:
Assuming that the head is currently at cylinder what is the time taken to satisfy all requests if it takes ms 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
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
