C program for FCFS and SJF that reads input from input.txt and writes the executed output in output.txt. The file is compiled using GCC-TDM and hence can be directly executed using program.exe. Our goal is to determine the average waiting time and average turnaround time for each method using the same input values. This will help us understand the concept of CPU Scheduling in a better way.
The input for the program should be supplied in "input.txt" as the following format:
<process_id>,<arrival_time>,<burst_time>
We will be using the following values for this example.
Once the values are entered, simply run program.exe to execute the algorithms.
First Come First Serve simply queues processes in the order they arrive in the ready queue. Here, the process that comes first will be executed first and next process will start only after the previous gets fully executed.
- Completion Time: Time at which process completes its execution.
- Turn Around Time: Time Difference between completion time and arrival time. (Turn Around Time = Completion Time – Arrival Time)
- Waiting Time: Time Difference between turn around time and burst time. (Waiting Time = Turn Around Time – Burst Time)
So, after executing program.exe, following will be the output for FCFS:
Shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the smallest execution time to execute next. SJN is a non-preemptive algorithm.
- Completion Time: Time at which process completes its execution.
- Turn Around Time: Time Difference between completion time and arrival time. (Turn Around Time = Completion Time – Arrival Time)
- Waiting Time: Time Difference between turn around time and burst time. (Waiting Time = Turn Around Time – Burst Time)
Following is the output for SJF:
By now your output should be written in "output.txt". (If this file does not exist, the program will create a new file. Otherwise it will override the existing file).
