Total Requests
Avg Seek Time
throughput
Efficiency
Disk scheduling algorithms determine the order in which disk I/O requests are serviced to minimize seek time and maximize throughput.
First Come First Serve processes requests in the order they arrive, regardless of their position on the disk.
Characteristics:
| Algorithm | Seek Time | Fairness | Starvation | Complexity |
|---|---|---|---|---|
| FCFS | Poor | Excellent | None | Low |
| SSTF | Good | Poor | Possible | Medium |
| SCAN | Good | Good | None | Medium |
| C-SCAN | Fair | Excellent | None | Medium |
| LOOK | Excellent | Good | None | Medium |
| C-LOOK | Excellent | Excellent | None | High |
Watch the disk arm movement and analyze seek time patterns!