Definition: Executes processes in arrival order.
Formula: WT = TAT - BT, TAT = CT - AT.
Advantages: Simple, predictable, easy to implement.
Disadvantages: Can cause convoy effect and poor average wait.
[CPU LAB / SCHEDULING MODE]
A terminal-inspired dashboard for studying process scheduling, ready queues, Gantt timelines, and algorithm performance.
[EDUCATION]
CPU scheduling decides which ready process receives processor time next. It affects waiting time, response time, throughput, and fairness. This visualizer compares classic scheduling strategies by showing process input, ready queue movement, execution order, timing metrics, and algorithm tradeoffs in a compact operating-system dashboard.
[ALGORITHM REFERENCE]
Definition: Executes processes in arrival order.
Formula: WT = TAT - BT, TAT = CT - AT.
Advantages: Simple, predictable, easy to implement.
Disadvantages: Can cause convoy effect and poor average wait.
Definition: Selects the arrived process with shortest burst time.
Formula: Minimum BT among ready processes.
Advantages: Often minimizes average waiting time.
Disadvantages: Requires burst prediction and may starve long jobs.
Definition: Preemptive SJF using shortest remaining time.
Formula: Minimum remaining BT at each decision point.
Advantages: Strong response for short processes.
Disadvantages: More context switches and possible starvation.
Definition: Executes processes based on priority level.
Formula: Select minimum priority value as highest priority.
Advantages: Handles critical tasks before less important work.
Disadvantages: Low-priority processes can starve without aging.
Definition: Rotates ready processes using a fixed time quantum.
Formula: Execute min(remaining BT, quantum).
Advantages: Fair, responsive, useful for time-sharing systems.
Disadvantages: Quantum choice strongly affects performance.
[PROCESS CONTROL]
| Process ID | Arrival Time | Burst Time | Priority |
|---|---|---|---|
| No processes loaded | |||
[SCHEDULER CONTROL]
[SIMULATION WORKSPACE]