ECCPU Scheduling Simulator with I/O
What is CPU scheduling?
The CPU scheduler decides which process to run next and for how long. In this simulator you can compare six classic algorithms, including processes that perform I/O operations (disk, network) during their lifetime.
How to use the simulator
- Choose the algorithm from the drop-down menu
- Add processes by specifying arrival time, CPU burst and (optionally) an I/O interrupt
- Click Calculate scheduling to see the Gantt chart and metrics
Available algorithms
| Algorithm | Type | Characteristic |
|---|---|---|
| FCFS | Non-preemptive | Arrival order |
| SJF | Non-preemptive | Shortest burst first |
| SRTF | Preemptive | SJF with preemption |
| Priority | Non-preemptive | Numeric priority (1 = highest) |
| Priority | Preemptive | With preemption |
| Round Robin | Preemptive | Fixed time quantum |
Calculated metrics
- Waiting time — time spent in the ready queue before being executed
- Turnaround time — from arrival to completion
- CPU utilization — percentage of time the CPU is not idle