Best result
Run the simulation to see which algorithm moves the disk head the least.
Algorithm reference
FCFS
First Come First Serve
Requests are serviced in the exact order they arrive.
+ Simple, Fair, No starvation
− Large head movement, Poor average seek time
SSTF
Shortest Seek Time First
Always picks the pending request closest to the current head position.
+ Lower seek time than FCFS, Good throughput
− Starvation of far requests, Not optimal
SCAN
Elevator Algorithm
Head moves in one direction to the end of the disk, then reverses.
+ No starvation, Uniform wait times
− Travels to disk end even with no requests there
C-SCAN
Circular SCAN
Head moves to the end, jumps back to the other end, and continues in the same direction.
+ More uniform waiting time than SCAN
− Return jump adds head movement
LOOK
LOOK
Like SCAN, but reverses at the last request instead of the disk end.
+ Avoids needless travel to disk end
− Slightly more logic than SCAN
C-LOOK
Circular LOOK
Like C-SCAN, but jumps from the last request to the first request on the other side.
+ Shorter return jump than C-SCAN
− Return jump still counts as movement
Note: For C-SCAN and C-LOOK, the return jump is included in total head movement.