Suppose a disk has 201 cylinders, numbered from 0 to 200. At same time the disk arm is at cylinder 10, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135, and 145. Find the total seek time for the disk scheduling algorithm FCFS and SSTF. Assume the head is movi
Suppose a disk has 201 cylinders, numbered from 0 to 200. At same time the disk arm is at cylinder 10, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135, and 145. Find the total seek time for the disk scheduling algorithm FCFS and SSTF. Assume the head is moving inward. [5]
Video solutionDisk Scheduling: FCFS and SSTF Seek Time3:17
Speed
Checked against the model answer before publishing.
- Total cylinders: 201 (numbered 0 to 200) - Initial head position: cylinder 10 - Request queue (order of arrival): 30, 85, 90, 100, 105, 110, 135, 145 - Head moving inward (toward higher cylinder numbers) --- Requests served in arrival order: $$10 \to 30 \to 85 \to 90 \to 100 \to 105 \to 110 \to...