CPU scheduling
Enter process data, pick an algorithm, then run or step through the simulation. Inputs are validated and clamped for safe classroom use.
Compare algorithms
Select multiple algorithms to compare average TAT and WT on the same workload.
Gantt chart
CPU execution order (from Gantt, Idle omitted):
Completion order (by completion time):
Step mode: use Step to advance the highlighted interval.
Results table
| PID | Arrival | Burst | Priority | Completion | TAT | WT |
|---|
Disk scheduling
Request queue as comma-separated cylinders. SCAN / C-SCAN use max cylinder and direction.
Configuration
Compare disk algorithms
Same queue and head; total seek time compared.
Seek sequence & summary
Total seek time
Step-by-step seeks
Head movement graph
Vertical axis = cylinder (track). Horizontal axis = visit order (each step is where the head moves next). Solid lines are real seeks; dashed lines are instant jumps (C-SCAN / C-LOOK — not counted in total seek).
Banker’s algorithm (safety & deadlock avoidance)
Enter Allocation, Max, and Available. The tool checks whether the state is safe (some order exists where all processes can finish) or unsafe (no such order — deadlock is possible in the worst case). This is a static safety check, not proof that the system is deadlocked right now.
Matrix size
After changing size, fill matrices. Classic 5×3 example loads below.
Test a resource request (optional)
If this request were granted immediately, would the resulting state stay safe?
Data entry
Step mode: use Next step to walk through the safety algorithm.
Result
Need matrix (Max − Allocation)
Algorithm trace
Page Replacement
Simulate FIFO, LRU and Optimal page replacement algorithms.
Configuration
Results
Faults: -
Hits: -
Hit Ratio: -