Suppose that a disk drive has 10000 cylinders (numbered 0-9999). It has just fin

Question

Suppose that a disk drive has 10000 cylinders (numbered 0-9999). It has just finished a request at cylinder 188, and the previous request was at 347. The queue of pending requests (in FIFO order) is: 8, 1982, 867, 112, 8722, 8272, 324, and 587. Starting at the current position, calculate the total distance (in cylinders) that the disk arm must move to satisfy all the pending requests for each of the disk scheduling algorithms:

a. FCFS

b. SSTF

c. SCAN

d. LOOK

e. C-LOOK

f. C-SCAN


For FCFS, I got 34525 as the total distance, but after that I get lost with the pecking order
for the remaining scheduling algorithms. So sorry for this embarrassing question! Again, thank you very much for your help and time!

Explanation / Answer

A......FCFS

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.