Rust · clap only · no fabricated numbers
Chronos is a CPU scheduler in Rust. It simulates FIFO, SJF, round-robin, priority, and MLFQ over a set of processes and reports the actual completion, turnaround, waiting, and response times. Here is the real algorithm, running in your browser.
| PID | Arrival | Burst | Completion | Turnaround | Waiting | Response |
|---|
The same five algorithms the Rust binary runs, ported line for line into the demo above.
Sorted by arrival time, ties by id. Runs each process to completion in that order, no interruption.
Non-preemptive. Among processes that have arrived, always picks the smallest remaining burst next.
Every ready process gets a fixed quantum, cycling through the queue until each one finishes.
Non-preemptive. Picks the lowest priority value among arrived processes, lower value runs first.
Three levels, quantum 4 then 8 then FCFS. A process that burns its whole quantum gets demoted a level.
Completion, turnaround, waiting, and response are computed from the real timeline, then averaged.
The same simulation, printed as a Gantt chart and a metrics table.
# round robin, quantum 2, three processes
cargo run -- run --algo rr --quantum 2 --procs "0:5,1:3,2:8"