This project aims to simulate and evaluate different scheduling algorithms, such as Round Robin, Priority Scheduling, and Earliest Deadline First. It's designed to generate metrics for each algorithm to facilitate a comparative analysis.
Python 3.7 or higher
This project has no dependencies, so there's no installation. Simply clone the repository!
To run the simulation, execute the main.py script:
python main.py- main.py: The entry point for the simulation.
- algorithm.py: Contains the implementation of the scheduling algorithms.
- metrics: Folder containing the collected metrics CSV files.
The simulation will generate metrics for each scheduling algorithm and save them in a CSV file. You can analyze this data to evaluate the efficiency and performance of each algorithm.
Distributed under the MIT License. See LICENSE for more information.