Suppose a disk has 100 cylinders from 0 to 99 where the current head position is 46. If the disk access request is 75, 73, 2, 77, 37, 12, 11, 53 and…
bitm Operating System · 2023 · Solved Question with Answer
Suppose a disk has 100 cylinders from 0 to 99 where the current head position is 46. If the disk access request is 75, 73, 2, 77, 37, 12, 11, 53 and 19 in order. Starting from the current head position calculate the total disk access time to serve all these request using:
a. FCFS algorithm
b. Shortest seek time first algorithm
The seek time from one cylinder to adjacent cylinder is 0.5 millisecond.