Consider a disk with the 100 tracks numbered from 0 to 99 rotating at 3000…
PYQ GATE 2001Modified — slightly modified from the official paper; see the solution
Consider a disk with the 100 tracks numbered from 0 to 99 rotating at 3000 rpm. The number of sectors per track is 100. the time to move the head between two successive tracks is 0.2 millisecond.
(a) Consider a set of disk requests to read data from tracks 32, 7, 45, 5 and 10. Assuming that the elevator algorithm is used to schedule disk requests, and the head is initially at track 25 moving up (towards larger track numbers), what is the total seek time for servicing the requests?
(b) Consider an initial set of 100 arbitrary disk requests and assume that no new disk requests arrive while servicing these requests. If the head is initially at track 0 and the elevator algorithm is used to schedule disk requests, what is the worst case time to complete all the requests?
For both parts, use LOOK: reverse at the last pending track. For the time bound in part (b), assume each request reads one sector, allow a full-revolution rotational wait per request, and ignore controller overhead.
Sign up free to check your answer
Sign up freeLoading lesson…

