Back to Operating Systems
Operating Systems
Disk Scheduling Simulator
Learn how Operating Systems optimize disk access requests using FCFS, SSTF and SCAN scheduling algorithms with real-time visualization.
Disk Scheduler Lab
Visualize seek operations and disk head movement.
FCFS
First Come First Serve executes requests in arrival order.
SSTF
Shortest Seek Time First selects nearest request.
SCAN
Disk arm moves like an elevator servicing requests.
Seek Time
Total head movement between disk tracks.
Simulation Controls
Example: 98 183 37 122 14 124 65 67
Total Seek Time
640
Average Seek Time
80.00
Execution Order
53
→
98
→
183
→
37
→
122
→
14
→
124
→
65
→
67
Disk Head Movement
53
Step 0
98
Step 1
183
Step 2
37
Step 3
122
Step 4
14
Step 5
124
Step 6
65
Step 7
67
Step 8
How Disk Scheduling Works
Disk Scheduling algorithms determine the order in which disk I/O requests are serviced.
Efficient scheduling minimizes seek time and improves overall Operating System performance.
Different algorithms focus on fairness, efficiency and reducing head movement.