1,020 views
0 votes
0 votes

Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given:

60, 50,10,50,80,25,70.

Assume that the initial position of the R/W head is on track 50.

1) If SSTF is used :

As current R/W head is at 50 and request queue also has request for 50 in queue so shortest seek time request will be 0 so it will be served first. Am i right ??

2) There are two requests for 50 in queue so both will have shortest seek as Head is already at 50 so both 50 request will be served before moving head somewhere else. AM right ? if not please explain

 

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
jatin khachane 1 asked Dec 11, 2018
1,160 views
Suppose a disk has 100 cylinders, numbered from 0 to 99. At some time the disk arm is at cylinder 20, and there is a queue of disk access requests for cylinders 10, 22, 6...
2 votes
2 votes
1 answer
3
akb1115 asked Aug 9, 2017
601 views
Order the following Disk Scheduling Algorithm on the basis of throughputFCFS, SCAN, C-SCAN, SSTF, LOOK, C-LOOK.