0
4.2kviews
Perform the computation for following scheduling algorithm :- (i) FIFO (ii) SSTF (iii) SCAN (iv) C-SCAN

On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to satisfy all requests in the disk queue. Assume the last request serviced was at track 345 and the head is moving towards track 0, the queue in FIFO order contains requests for the following tracks:

123,874,692,475,105,376

Perform the computation for the following scheduling algorithm:-

(i) FIFO (ii) SSTF (iii) SCAN (iv) C-SCAN

1 Answer
0
245views

First Come First Serve (FCFS) Disk Scheduling

FCFS

Total Head Movements

= (345 - 123) + (874 - 123) + (874 - 692) + (692 - 475) + (475 - 105) + (376 - 105)

= 222 + 751 + 182 + 217 + 370 + 271

= 2013 Cylinders

Average …

Create a free account to keep reading this post.

and 5 others joined a min ago.

Please log in to add an answer.