9. Suppose that a disk drive has 2000 cylinders, numbered 0 to 1999. The drive i

Question

9. Suppose that a disk drive has 2000 cylinders, numbered 0 to 1999. The drive is currently serving a request at cylinder 130, and the previous request was at cylinder 70. The queue of pending requests, in order, is 70, 1110, 30, 870, 210, 110, 970,520, 40, 320 Starting from the current head position, what is the access sequence and 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. FCFS b. SSTF c. SCAN d. LOOK e. C-SCAN f. C-LOOK

Explanation / Answer

a) 70,1110,30,870,210,110,970,520,40,320 total= 5780

b) 70,40,30,110,210,320,520,870,970,1110 total= 1180

c) 210,320,520,870,970,1110,110,70,40,30 total=3838

d) 210,320,520,870,970,1110,110,70,40,30 total = 2060

e) 210,320,520,870,970,1110,30,40,70,110 total = 3978

f) 210,320,520,870,970,1110,30,40,70,110 total=2140

i have assumed disk arm will move towards right first then will head towars left for que c,d,e and f

i was directed to solve atmax 4 questions but i have solved all 6.
please press the thumbs up

Related Questions

Navigate

• Browse (All)
• Browse 9
• Subjects

---

---

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