This repository contains a C++ program that demonstrates various process scheduling algorithms, including FCFS (First-Come, First-Served), SJF (Shortest Job First), SRTF (Shortest Remaining Time First), and RR (Round Robin).
To run the program, follow these steps:
-
Clone this repository to your local machine.
git clone git@github.com:Dhru08/Operating-System-Scheduling-algorithms.git
-
Navigate to the project directory.
cd Operating-System-Scheduling-algorithms -
Compile the C++ program.
g++ main.cpp -o main
-
Run the executable.
./main
-
When you run the program, it will prompt you to enter the number of processes and their arrival times and burst times. Follow the on-screen instructions to input the necessary data.
-
The program will then display a menu for selecting the scheduling algorithm you want to simulate (FCFS, SJF, SRTF, RR). Enter the corresponding number to choose an algorithm.
-
The program will simulate the selected algorithm and display the Gantt chart and various scheduling metrics, such as average turnaround time, average waiting time, average response time, and overall throughput.
-
You can repeat the process to try different scheduling algorithms or exit the program.
This algorithm schedules processes in the order they arrive.
This algorithm schedules processes based on their burst times, selecting the shortest job first.
SRTF is a preemptive version of SJF. It selects the process with the shortest remaining time to execute.
RR is a time-sharing algorithm where each process is assigned a fixed time quanta for execution. If a process does not complete within its time quanta, it is moved to the back of the queue.
- This code was created to demonstrate various process scheduling algorithms and can be used for educational purposes.
- Feel free to customize and extend this code for your own use.