Question: In this question there is a simple disk with a single track. The disk uses a simple FIFO scheduling policy. For the disk, the rotational
In this question there is a simple disk with a single track. The disk uses a simple FIFO scheduling policy. For the disk, the rotational delay is defined asR.There is no seek time as there is only a single track, and transfer time is almost instantaneous, so we do not assign a value to it. What is the approximate worst case execution time for three requests to different blocks?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
