SISTEM PENGENDALIAN $/$ OPERATING SYSTEM

Example:

In non$-$preemptive scheduling, once the CPU cycle is allocated to process, the process holds it till it reaches a waiting state or terminated.

Consider the following five processes each having its own unique burst time and arrival time.

$\backslash$table$[[$Process Queue,Burst time $($s$),$Arrival time $($s$),\backslash$table$[[$Priority$],[($Highest Priority $=1)],[($Lowest Priority $=3)]]],[$P$1,6,2,3],[$P$2,2,5,3],[$P$3,8,1,3],[$P$4,3,0,3],[$P$5,4,4,3]]$

Table $1$: Example of process details

$\backslash$table$[[$P$4,$P$1,$P$2,$P$5,$P$3,,],[0,3,9,11,23]]$

Burst time is the amount of CPU time the process requires to complete its execution.

$\backslash$table$[[$Process Queue,Burst time $($s$),$Arrival time $($s$),\backslash$table$[[$Priority$],[($Highest Priority $=1)],[($Lowest Priority $=3)]]],[$P$1,4,0,1],[$P$2,1,0,3],[$P$3,5,3,2],[$P$4,9,6,3],[$P$5,2,4,1]]$

Table $2$: Process details

Part $2$:

Using Table $2$ in Part $1,$ create Gantt chart $($see example Figure $1)$ for the following scheduling algorithms:

$(1)$ First Come First Serve with Round Robin Scheduling Algorithm $-$ A process will run for a maximum of $5$ seconds before being halted to permit the next process in the queue to run. The sequence of execution will follow the first$-$come, first$-$served scheduling algorithm.