This project is about a CPU scheduling simulator that allows users to simulate and compare different scheduling algorithms.
The simulator includes a GUI that allows you to manipulate and run simulations, as well as display the results.
This program provides those scheduling algorithms.
- FCFS - First Come, First Served.
- SJF - Non-Preemptive Shortest-Job First
- SRTF - Shortest Remaining Time First
- Non-preemptive Priority
- Priority
- Round Robin
- JRE 11 or later
- JDK 11 or later
- IntelliJ IDEA Community Edition or IntelliJ IDEA Ultimate 2020.3 or later
- The Compose Multiplatform IDE support plugin
- For more details, visit https://github.com/JetBrains/compose-multiplatform-desktop-template/#readme
To execute the CSV file of your choice, simply click on it and then click the "Run" button. This will enable you to view both the result tables and the Gantt chart.
| PID | Arrival Time | Burst Time |
|---|---|---|
| 1 | 1 | 24 |
| 2 | 2 | 3 |
| 3 | 3 | 3 |
You can add "Priority" right next to "Burst Time" in the sample, as it may include Priority values.
After running the program, you can simply drag them to see more.
