Consider the arrival time and burst time of six jobs specified in the table below.

Apply the Shortest Remaining Time to Finish $($SRTF$)$ operating system algorithm.

Generate a table to identify the process id$,$ exit time, turn around time, waiting time, and response time.

Generate a Gantt chart to show when each process is executed.

Calculate the average turn around time of the processes.

Calculate the average wait time of the processes.

Calculate the average response time of the processes.

Process ID Arrival Time Burst Time

$169$

$216$

$395$

$402$

$543$

$6127$

Time Table

Process ID Exit Time Turn Around Time Waiting Time Response Time

$1$

$2$

$3$

$4$

$5$

$6$

Gantt Chart

Process ID

Time $0$ # # # # # # # # # # #

Average turn around time $=$

Average waiting time $=$

Average response time $=$

Compare and analyze the results from the three scheduling algorithms.

Scheduling algorithm Average turn around time Average wait time Average response time

FCFS

SJF

SRTF

Which OS process scheduling algorithm performed the best in regard to a system where user responsiveness is critical?

Which metric determined the scheduling algorithm selection?