edited by
10,718 views
34 votes
34 votes
Suppose a disk has $201$ cylinders, numbered from $0$ to $200$. At some time the disk arm is at cylinder $100$, and there is a queue of disk access requests for cylinders $30, 85, 90, 100, 105, 110, 135$ and $145$. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request for cylinder $90$ is serviced after servicing ____________ number of requests.
edited by

4 Answers

Best answer
42 votes
42 votes
Requests are serviced in following order

$100 \ 105 \ 110 \ 90 \ 85 \ 135 \ 145 \ 30$

So, request of $90$ is serviced after $3$ requests.
edited by
10 votes
10 votes
You might think that service requests are 2 but it is wrong why?

You must include service request 100 also.
( 100,105,110 then 90 service request will be taken. )
So Answer is 3
2 votes
2 votes
In Shortest-Seek-First algorithm, request closest to the current position of the disk arm and head is handled first. In this question, the arm is currently at cylinder number 100. Now the requests come in the queue order for cylinder numbers 30, 85, 90, 100, 105, 110, 135 and 145. The disk will service that request first whose cylinder number is closest to its arm. Hence 1st serviced request is for cylinder no 100 ( as the arm is itself pointing to it ), then 105, then 110, and then the arm comes to service request for cylinder 90. Hence before servicing request for cylinder 90, the disk would had serviced 3 requests. Hence option C.
Answer:

Related questions

27 votes
27 votes
2 answers
1
24 votes
24 votes
4 answers
2
go_editor asked Sep 26, 2014
7,253 views
Assume that there are $3$ page frames which are initially empty. If the page reference string is $\text{1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6}$ the number of page faults using ...
100 votes
100 votes
10 answers
4