S $3733$ Operating Systems assign$03$

You are required to submit your work through Canvas $!!!$ NO E$-$MAIL SUBMISSION $!!!$

$!!!!$ Please carefully check the DUE DATE on Canvas $!!!!$

$!!!!$ NO LATE SUBMISSION WILL BE ACCEPTED $!!!!$ After the due date, submission link on Canvas may disappear.

Create a directory called assign$3$ for this assignment under cs$3733.$

Write all your programs under assign$3.$

You need to implement this assignment using C with pthread library!!! $($no Java$)$

Objective

Learn and practice CPU scheduling algorithms by implementing them.

Learn and practice process$/$thread synchronization mechanisms by implementing them.

Practice system calls and library functions.

Overview

In this homework, you are asked to implement a multithreaded program that will allow us to simulate the four basic CPU scheduling algorithms $($namely$,$ FIFO, SJF$,$ PR$,$ and RR$)$ and measure their performance metrics $($i$.$e$.,$ CPU utilization, Throughput, Turnaround time, and Waiting time in Ready Queue$).$ Your program will be emulating$/$simulating the processes whose priority, sequence of CPU burst time $($ms$)$ and I$/$O burst time $($ms$)$ will be given in an input file.

Assume that all scheduling algorithms except RR will be non$-$preemptive, and all scheduling algorithms except PR will ignore process priorities $($i$.$e$.,$ all processes have the same priority in FIFO, SJF and RR$).$ Also assume that there is only one IO device, and all I$/$O requests will be served using that device in a FIFO manner $($note that, to focus on CPU queue in the lecture notes, we were assuming unlimited number of I$/$O devices, but that was not practical$).$