retagged by
9,636 views
8 8 votes

Disk requests are received by a disk drive for cylinder 5, 25, 18, 3, 39, 8 and 35 in that order. A seek takes 5 msec per cylinder moved. How much seek time is needed to serve these requests for a Shortest Seek First (SSF) algorithm? Assume that the arm is at cylinder 20 when the last of these requests is made with none of the requests yet served

  1. 125 msec
  2. 295 msec
  3. 575 msec
  4. 750 msec

3 Answers

Best answer
21 21 votes
Initially cylinder is at 20. So, as per shortest seek time, the requests will be serviced in the order: 18, 25, 35, 39, 8, 5, 3. So, total no. of seeks

$= (20-18)+ (25-18) + (35-25) + (39-35) + (39-8) + (8-5) + (5-3)$

$= 2+ 7 + 10 + 4 + 31 + 3 + 2 = 59$.

A seek takes 5 msec. So, total seek time = $59 \times 5 = 295 msec.$
edited by
2 2 votes
if at starting at o then order will be 0-3-5-8-18-25-35-39(total movements =3+2+3+10+7+10+4=39

total time 39x5=195 msec
2 2 votes

Solution with minimum calculation:

With shortest seek time, the requests will be in order: 18,25,35,39, 8, 5,3

  • First Arm will move backward, = 20-18 =2
  • Then forward = 39-18 =21
  • Then backward = 39-3= 36

Total seek time =5*(2+21+36)= 295 ms

Answer:
Position:
Show:

Related questions

9 9 votes
3 answers 3 answers
5.0k
5.0k views
go_editor asked Jun 10, 2016
5,013 views
Which of the following RAID level provides the highest Data Transfer Rate (Read/Write)RAID 1RAID 3RAID 4RAID 5
61 61 votes
5 answers 5 answers
14.5k
14.5k views
Kathleen asked Sep 17, 2014
14,477 views
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...
11 11 votes
3 answers 3 answers
6.2k
6.2k views
go_editor asked Jun 10, 2016
6,194 views
Feedback queuesare very simple to implementdispatch tasks according to execution characteristicsare used to favour real time tasksrequire manual intervention to implement...
8 8 votes
2 answers 2 answers
9.0k
9.0k views
go_editor asked Jun 10, 2016
8,958 views
On a system using non-preemptive scheduling, processes with expected run times of 5, 18, 9 and 12 are in the ready queue. In what order should they be run to minimize wai...