This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 49, 91, 22, 61, 7, 62, 33, 35 Suppose also, that the read/write heads are currently at cylinder 26. The question is now: To which cylinder should the disk heads move next? Different algorithms produce different answers to that question. First-Come, First-Served Disk Scheduling In Chapter 10 we examined a CPU scheduling algorithm called first-come , first-served (FCFS) . An analogous algorithm can be used for disk scheduling. It is one of the easiest to implement, though not usually the most efficient....
View Full Document
This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.
- Fall '10