Question: Disk Scheduling Suppose a disk has 2000 cylinders, numbered 0 to 1999. The drive is currently serving a request at cylinder 80, and the previous

Disk Scheduling

Suppose a disk has 2000 cylinders, numbered 0 to 1999. The drive is currently serving a request at cylinder 80, and the previous request was at cylinder 120. The queue of pending requests, in FIFO order, is for blocks at cylinders:

100

1500

800

1800

900

1600

1000

1700

200

Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms?

a. first-come-first-served

b. shortest-distance-first

c. SCAN (service requests in both directions, always move to the edge of the disk even if no requests are there)

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!