A comprehensive CPU Scheduling Simulator built with Python, leveraging Tkinter for the GUI and Matplotlib for generating Gantt charts and detailed tables. This simulator provides an interactive way to understand how different CPU scheduling algorithms work, including Round Robin, Preemptive Shortest Job First (SJF), Non-Preemptive SJF, and Non-Preemptive Priority scheduling.
The simulator is made by
Mohd Azriy Akmalhazim Bin Mohd Nazariee | 1211104288
Muhammad Amir Adib Bin Mohd Aminuddin | 1211103233
Meor Imran Najmuddin | 1211101518
- Interactive GUI: Utilizes Tkinter for an easy-to-navigate graphical user interface, allowing users to input process details such as burst time, arrival time, and priority.
- Multiple Scheduling Algorithms: Supports Round Robin, Preemptive SJF, Non-Preemptive SJF, and Non-Preemptive Priority scheduling algorithms.
- Visualization: Generates Gantt charts and detailed tables for each scheduling algorithm using Matplotlib, providing visual insights into the scheduling process and its outcome.
- Dynamic Input: Users can specify the number of processes and input specific details for each, including burst time, arrival time, and priority.
- Customizable: Easy to adapt and extend with more scheduling algorithms or enhanced features.
Ensure you have Python installed on your system. This project requires Python 3.x.
-
Clone the repository to your local machine (Or download the ZIP file and extract it).
The command to clone the repository is as follows:
git clone https://github.com/Azriy-Nazariee/CPU-Scheduling- Navigate into the project directory:
cd cpu-scheduling-simulator
- Install the required dependencies:
pip install matplotlib tk
To run the simulator, execute the following command in the terminal:
python GUI.py
Upon launch, the GUI will guide you through the following steps:
- Select a Scheduling Algorithm: Choose one of the available CPU scheduling algorithms from the main menu.
- Input Process Details: Enter the number of processes and specify their burst time, arrival time, and priority.
- Simulation and Visualization: After inputting the process details, the simulator will compute the scheduling based on the selected algorithm and display the Gantt chart and a detailed table showing the finish time, turnaround time, and waiting time for each process.