1) Define Jobs
| # | Process | Arrival | Burst | Priority |
|---|
2) Choose Algorithm & Options
3) Results
Per-Process Metrics
| Process | Arrival | Burst | Start | Completion | Turnaround | Waiting | Response |
|---|
How it was done (Step-by-step)
Notes & Assumptions
- Arrival and burst times are treated as integers (ms or arbitrary time units).
- SJF can be preemptive (SRTF) or non-preemptive; Priority is configurable as preemptive/non-preemptive and priority direction.
- Round Robin uses a ready queue; newly arrived jobs are enqueued but do not preempt the current job until its quantum ends.
- Idle gaps are shown when the CPU is not executing any job.