CPU Scheduling Algorithms

This program simulates and visualizes various CPU scheduling algorithms: First-Come-First-Serve (FCFS), Shortest Job First (SJF), Priority Scheduling, and Round Robin (RR). It calculates key scheduling metrics like Turnaround Time (TAT) and Waiting Time (WT) and displays the results in a table along with a Gantt Chart visualization.

Features

• First-Come-First-Serve (FCFS): A non-preemptive scheduling algorithm where processes are executed in the order they arrive.
• Shortest Job First (SJF): A non-preemptive scheduling algorithm where processes with the shortest burst time are executed first.
• Priority Scheduling: A non-preemptive scheduling algorithm where processes with the highest priority are executed first.
• Round Robin (RR): A preemptive scheduling algorithm that assigns a fixed time quantum to each process.

Prerequisites

To run the program, you need Python installed along with the following dependencies:

• matplotlib for Gantt chart visualization
• pandas for tabular display of results

You can install these libraries using pip:

pip install matplotlib pandas

Running the Program

1. Clone or download the repository to your local machine.
2. Navigate to the project directory and open a terminal or command prompt.
3. Run the program using the following command:

python cpu_scheduling.py

Program Flow

1. The program will display a menu with the following options:

• 1: First-Come-First-Serve (FCFS)
• 2: Shortest Job First (SJF)
• 3: Priority Scheduling
• 4: Round Robin (RR)
• 5: Exit

2. Choose the desired scheduling algorithm by entering the corresponding number.

3. For the selected algorithm, input the number of processes and their respective arrival times and burst times (and priority for Priority Scheduling).

4. If you select Round Robin, you will also need to input a time quantum.

5. After inputting the data, the program will calculate the Turnaround Time (TAT) and Waiting Time (WT) for each process, then display the results in a table format along with a Gantt chart.

6. The program will also display the average Turnaround Time and average Waiting Time for all processes.

Example Run

CPU Scheduling Algorithms
1. First-Come-First-Serve (FCFS)
2. Shortest Job First (Non-Preemptive)
3. Priority Scheduling (Non-Preemptive)
4. Round Robin (Preemptive)
5. Exit
Enter your choice: 1
Enter number of processes: 3
Enter arrival time for Process 1: 2
Enter burst time for Process 1: 15
Enter arrival time for Process 2: 3
Enter burst time for Process 2: 30
Enter arrival time for Process 3: 5
Enter burst time for Process 3: 20

The program will display the results in a table along with a Gantt chart for the selected algorithm.

Example Output

Gantt Chart:

The program also generates a Gantt chart to visually represent the execution timeline of the processes.

Notes

• The program uses non-preemptive scheduling algorithms for FCFS, SJF, and Priority Scheduling.
• Round Robin is a preemptive algorithm where each process getrs a fixed time quantum.
• The metrics (Turnaround and Waiting Time) are calculated for each processes and averages are displayed at the end.