PROCESS SCHEDULING

Experiment Number 6 : Shortest Remaining Time First

Algorithm

• Step 1: Traverse until all process gets completely executed.

• Step 2: Find process with minimum remaining time at every single time lap.

• Step 3: Reduce its time by 1.

• Step 4: Check if its remaining time becomes 0.

• Step 5: Increment the counter of process completion.

• Step 6: Completion time of current process = current_time + 1;

• Step 7: Calculate waiting time for each completed process. wt[i]= Completion time - Arrival Time-Burst Time.

• Step 8: Increment time lap by one.

• Step 9: Find turnaround time (Waiting Time + Burst Time).