CPU Scheduling Tutorial

Question: Consider the following Processes Information:

$\backslash$table$[[$Process$,\backslash$table$[[$Arrival Time$],[($Nano Seconds$)]],\backslash$table$[[$Burst Time$],[($Nano Seconds$)]],\backslash$table$[[$Priority$],[($Low Number higher priority$)]]],[$P$1,0,10,4],[$P$2,2,4,3],[$P$3,4,8,1],[$P$4,6,2,3],[$P$5,10,12,1],[$P$6,14,6,2],[$P$7,18,2,]]$

For each of the following CPU scheduling algorithms, draw the Gantt chart, and calculate :

a$)$ Waiting time for each process.

b$)$ Turnaround time for each process.

c$)$ Average waiting time for each algorithm.

d$)$ Average turnaround time for each algorithm.

e$)$ Throughput for each algorithm, where Throughput is calculated for number of processes finished within the first $25$ Nano Seconds.

First Come First Served Algorithm.

Shortest Job First Algorithm.

Shortest Remaining Job First Algorithm.

Preemptive Priority Algorithm, with aging for processes waiting for more than $8$ Nano Seconds.

Round Ropin Algorithm with time Quantum $=3$ Nano Seconds. And scheduled according to non$-$preemptive priority.

Note: consider that context switch time