you will write a complete C program that implement a
simulation for the Shortest Remaining Time First (SRTF) preemptive CPU scheduling
algorithm. Note that in this exercise, we know the burst time of each process.
You will read input using a file (you must prompt for the name of the file) where the input
will be formatted as follows on each line (using whitespace as a delimiter):
ProcessID ArrivalTime BurstTime
where ProcessID is a C-string up to 6 characters (5 with a NULL terminator) and the
ArrivalTime and BurstTime are integers, representing units of time. See the
SAMPLE OUTPUT for examples of some input files. There is no limit to the number of
processes supported by your CPU scheduler, so you will need to read the file to
determine how many processes are specified (note that each process must be specified
in the file on a separate line).
Based on the SRTF algorithm, you will calculate the finish and wait times for each
process as well as the average throughput, waiting time, and turnaround time for the
Greetings, I am an electrical engineer with vast experience in C and embedded C. I have read about the SRTF algorithm that you have mentioned and it can be implemented easily within a few days.