$8$ points

Five jobs P$1,...$ P$5$ arrive at a processor at time $0,1,2,3,4$ and the lengths of their CPU bursts are $8,2,3,1,5,$ respectively. Draw the Gantt Chart and calculate the average

waiting time and the average response time for the following policies:

SJF $($Shortest$-$Job$-$First$)$ scheduling policy.

SRTF $($Shortest$-$Remaining$-$Time$-$First$)$ scheduling policy.

P$-$PS $($Preemptive priority$)$ scheduling policy with priority assignment $(3,2,1,4,3)$ to $(P1,$dots,$P5),$ where priority $1$ is the highest priority.

RR $($Round$-$Robin$)$ scheduling policy with a time quantum of $2.$

Drag n$\text{'}$ Drop here or Browse

We consider the above question for a simplified MLFQ scheduling policy with simplification. We ignore priority boost and I$/$O and the detailed policy is as follows: A new job

enters Q$1$ in Round$-$Robin $($RR$).$ When it gains CPU, job receives $1$ time unit; If it does not finish in $1$ time unit, it is moved to Q$2.$ At Q$2,$ job is again served in RR and receives $2$

time units. If it still does not complete, it is preempted and moved to Q$3.$ Run RR in Q$3$ with quantum size $4.$