Hands On Problem: Process Scheduling Simulation

Problem Statement:

You are tasked with simulating a simple operating system's process scheduler to understand how different scheduling algorithms impact process execution. In this simulation, you will work with three scheduling algorithms: First$-$Come, First$-$Served $($FCFS$),$ Shortest Job Next $($SJN$),$ and Round Robin $($RR$).$ Your task is to implement these algorithms and compare their performance based on average waiting time and average turnaround time.

Given Data:

You have the following set of processes, each with a unique process ID $($PID$),$ arrival time, and burst time:

PID, Arrival Time, Burst Time

P$1$: $0,8$

P$2$: $1,4$

P$3$: $2,9$

P$4$: $3,5$

Tasks:

$1.$ Implement the Scheduling Algorithms:

$$ FCFS: Schedule the processes based on their arrival times.

$$ SJN: Schedule the processes based on the shortest burst time.

$$ RR: Use a time quantum of $4$ units for the Round Robin scheduling.

$2.$ Calculate Metrics:

$$ Waiting Time: The total time a process spends waiting in the ready queue before it gets executed.

$$ Turnaround Time: The total time taken from the arrival of the process to its completion.

$$ Compute the average waiting time and average turnaround time for each scheduling algorithm.

$3.$ Compare Results:

$$ Create a table comparing the average waiting time and average turnaround time for the three scheduling algorithms.

$$ Discuss the pros and cons of each scheduling algorithm based on your results.

Example Output Format:

Scheduling Algorithm, Average Waiting Time, Average Turnaround Time

FCFS$,$ XX$,$ YY

SJN$,$ XX$,$ YY

RR$,$ XX$,$ YY

Discussion Questions:

$1.$ Which scheduling algorithm resulted in the lowest average waiting time? Why do you think that is the case?

$2.$ How does the choice of time quantum affect the performance of the Round Robin scheduling algorithm?

$3.$ In what scenarios might you prefer FCFS over SJN$,$ and vice versa?

$4.$ Explain how the arrival time of processes influences the performance of these scheduling algorithms.