CPU scheduling
Choose an algorithm, or compare all of them.
Manual
Write one process per line as four values: an id, its arrival time, its burst time and its priority. Times are whole numbers. A lower priority number runs first. Pick an algorithm and press Run.
The result shows a timeline of who ran when, then each process with completion time (CT), turnaround time (TAT = CT minus arrival) and waiting time (WT = TAT minus burst), then the averages. Compare all prints only the averages, with the lowest waiting time in green.
Preemptive modes can interrupt the running process whenever something better has arrived. Round Robin gives each process the quantum in turn.
Python version: cp.py (run python3 cp.py). Text manual: MANUAL.txt.