Question: Consider a disk queue holding requests to the following cylinders in the listed order: 28, 39, 241, 95, 153, 88, 25, 182 Using the SCAN

Consider a disk queue holding requests to the following cylinders in the listed order: 28, 39, 241, 95, 153, 88, 25, 182 Using the SCAN scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 92. (4 marks) FCFS scheduling. SCAN scheduling (arm is moving down from cylinder 92). C-SCAN scheduling (arm is moving down from cylinder 92). Which algorithm gives the best result (services all the requests with the minimum amount of movement).

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!