AVG. WAITING TIME
–units
OPERATING SYSTEMS / INTERACTIVE LAB
Algorithm Comparison Dashboard
Explore, simulate and compare CPU scheduling algorithms with real performance metrics.
AVG. TURNAROUND
–units
AVG. RESPONSE TIME
–units
CPU UTILIZATION
–%
PERFORMANCE ANALYTICS
Algorithm comparison
Compare the same workload across six scheduling strategies.
Time / metric value Lower is better
RANKED RESULTS
Leaderboard
Ranked by lowest waiting time
INTERACTIVE PLAYGROUND
Process simulator
Edit processes to see how the CPU schedules them. Arrival and burst values are in time units.
Process input
5 processes| PROCESS | ARRIVAL | BURST | PRIORITY ? | Remove |
|---|
Simulation controls
Configure the scheduling algorithm
Processes run in the order they arrive. Simple, but long tasks may delay short ones.
3 units
112
Processes5
Total burst20 units
Context switches–
SCHEDULING VISUALIZER
Execution timeline
See the real process order and idle time with a color-coded Gantt chart.
CPU EXECUTION
First Come First Served
MAKESPAN–
THROUGHPUT–
CPU IDLE–
CONTEXT SWITCHES–
COMPLETE BREAKDOWN
Performance results
Computed averages and resource metrics for every supported algorithm.
| ALGORITHM | AVG. WAITING ↓ | AVG. TURNAROUND ↓ | AVG. RESPONSE ↓ | THROUGHPUT ↑ | CPU USE ↑ | SWITCHES | RESULT |
|---|
Time values use abstract time units; throughput is processes per time unit.Based on 5 input processes
Algorithm notes
Model assumptions: one CPU; known burst times; no I/O blocking; zero context-switch overhead; a lower priority number means higher priority. Ties resolve by arrival time and then input order. Idle time counts toward CPU utilization.