This repository contains implementations and visualizations for various scheduling algorithms.
- https://shortest-remaining-time.vercel.app/
- https://shortest-job-first.vercel.app/
- https://highest-response-ratio-next.vercel.app/
This repository contains implementations and visualizations for various scheduling algorithms.
The Round Robin algorithm is implemented in this task.
To run the Round Robin algorithm, navigate to the task1
folder and follow the instructions below
- Clone the repository:
https://github.com/umershaikh123/OperatingSystem.git
- Navigate to the project directory:
cd OperatingSystem/Task1
- Run the simulation:
node .\Final.js
This task implements the Shortest Remaining Time (SRT), Shortest Job First (SJF), and Highest Response Ratio Next (HRRN) scheduling algorithms. It includes a GUI and visualization for better understanding.
- Shortest Remaining Time (SRT)
- Shortest Job First (SJF)
- Highest Response Ratio Next (HRRN)
- Navigate to the
task2
folder. - run the htnl live sever in vscode for the desired algorithm
The GUI and visualization provide an interactive interface to understand the behavior of the implemented scheduling algorithms.
task1
: Contains the implementation of the Round Robin algorithm.task2
: Contains the implementations of SRT, SJF, and HRRN algorithms with GUI and visualization.
Contributions to this simulation are welcome! Feel free to fork this repository, make improvements, and submit pull requests.
This project is licensed under the MIT License - see the LICENSE file for details.