โ† CS Visual Lab ยท Operating Systems

๐Ÿ’ฝ Disk scheduling

๐Ÿ’ก The ideaThe disk head moves across cylinders to serve requests. FCFS serves in order, SSTF picks the nearest, SCAN sweeps to the end like a lift, C-SCAN sweeps one way and jumps back, LOOK turns at the last request instead of the end.
๐Ÿ  In real lifeA lift in a building: SCAN goes all the way up, then down, picking people on the way; SSTF always goes to the nearest floor that pressed the button.

๐ŸŽฌ Watch it work

Step 1 of 9
05010015019953

Head at 53 ยท moved 0 cylinders so far ยท total for SSTF: 236

โœ… Check yourself (2 of 3 to pass)

1. Which algorithm can starve far-away requests?
2. SCAN is also called:
3. LOOK differs from SCAN because it:
Next: Process states โ†’Get a free certificate in Operating Systems