recategorized
4,551 views
1 votes
1 votes

Consider a disk queue with I/O requests on the following cylinders in their arriving order: $6,10,12,54,97,73,128,15,44,110,34,45$. The disk head is assumed to be at cylinder $23$ and moving in the direction of decreasing number of cylinders. Total number of cylinders  in the disk is $150$. The disk head movement using  SCAN –scheduling algorithm is:

  1. $172$    
  2. $173$  
  3. $227$ 
  4. $228$
recategorized

6 Answers

0 votes
0 votes
The R/W head current position is at cylinder 23 and moving inwards (low cylinder).

Range of cylinders [0,150].

So it will move 23 to 0 and then changes direction from 0 to largest cylinder of I/O request which is 128.

So, total head movement is = (23-0) + (128-0) = 151.
0 votes
0 votes
SCAN scheduling algorithm used therfore scans all the cylinders of the disk back and forth.

In this ques,  Head moves from 23 to 0 then from 0 to 128 servicing all the requests in between.

Therefore,  disk movement = (23-0)+(128-0) =151.
Answer:

Related questions

4 votes
4 votes
5 answers
1
go_editor asked Mar 24, 2020
1,675 views
Which of the following is incorrect for virtual memory?Large programs can be writtenMore I/O is requiredMore addressable memory availableFaster and easy swapping of proce...
0 votes
0 votes
4 answers
2
go_editor asked Mar 24, 2020
1,489 views
Match the following for Unix file system : $\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\ \text{a.} & \text{Boot block} & \text{i.} & \text{Informat...