$1.$ Introduction

After some initial analysis, UnimasMeta found that Round Robin $($RR$)$ has better

performance compared to other process scheduling algorithms namely First$-$come FirstServed $($FCFS$),$ Shortest job next $($SJN$),$ and S$1.$ Introduction

After some initial analysis, UnimasMeta found that Round Robin $($RR$)$ has better

performance compared to other process scheduling algorithms namely First$-$come FirstServed $($FCFS$),$ Shortest job next $($SJN$),$ and Shortest remaining time $($SRT$).$ However, to

have a holistic analysis on the best time quantum according to the client specification, a

list of jobs used by the client is provided to UnimasMeta for further analysis.

Your tasks are to:

$($a$)$ Implement or code the Round Robin algorithm which was designed during

the TMF$2234$ Operating System assignment, with C $/$ C$++$ programing language.

$($b$)$ Use the program to read the provided job list. The job list for your group is

provided separately in an excel file based on your group number. Use only a job

list assigned to your group. Each group will get a different job list.

$($c$)$ Evaluate the job list with different time quantum: $[5,10,15,20,25,30,35,$

$40,45,50,55,60],$ by determining the following performance metrics:

$($i$)$ Turnaround time of the jobs;

$($ii$)$ Waiting time of the jobs; and

$($iii$)$ Number of interrupts incurred.

$($d$)$ Recommend the best time quantum for your job list based on your evaluation in

$($c$).$ Use suitable charts to explain and justify your recommendation.

$($e$)$ Prepare a $10$ minute presentation that reports on the performance evaluation

of all time quantum and your recommendation of the best time quantum.

Assumptions

$($a$)$ All the arrived jobs are at $$Ready State$$ and ready to be processed by the CPU.

$($b$)$ Only ONE $(1)$ CPU available for processing the jobs.

$($c$)$ Each context switching incurs ONE $(1)$ CPU CYCLE.

$($d$)$ Memory is always sufficient to hold any jobs.

$($e$)$ Each job has mixture of CPU and I$/$O instructions, and the integer between the

brackets indicates CPU or I$/$O cycle required for each instruction $($Please refer to

the job list assigned to your group$).$

Example:

CPU $(20)$ The integer $20$ represents the computational instruction requires $20$

CPU cycle to compute.

I$/$O $(40)$ The integer $40$ represents the I$/$O instruction requires $40$ CPU cycle to

completehortest remaining time $($SRT$).$ However, to

have a holistic analysis on the best time quantum according to the client specification, a

list of jobs used by the client is provided to UnimasMeta for further analysis.

Your tasks are to:

$($a$)$ Implement or code the Round Robin algorithm which was designed during

the TMF$2234$ Operating System assignment, with C $/$ C$++$ programing language.

$($b$)$ Use the program to read the provided job list. The job list for your group is

provided separately in an excel file based on your group number. Use only a job

list assigned to your group. Each group will get a different job list.

$($c$)$ Evaluate the job list with different time quantum: $[5,10,15,20,25,30,35,$

$40,45,50,55,60],$ by determining the following performance metrics:

$($i$)$ Turnaround time of the jobs;

$($ii$)$ Waiting time of the jobs; and

$($iii$)$ Number of interrupts incurred.

$($d$)$ Recommend the best time quantum for your job list based on your evaluation in

$($c$).$ Use suitable charts to explain and justify your recommendation.

$($e$)$ Prepare a $10$ minute presentation that reports on the performance evaluation

of all time quantum and your recommendation of the best time quantum.

Assumptions

$($a$)$ All the arrived jobs are at $$Ready State$$ and ready to be processed by the CPU.

$($b$)$ Only ONE $(1)$ CPU available for processing the jobs.

$($c$)$ Each context switching incurs ONE $(1)$ CPU CYCLE.

$($d$)$ Memory is always sufficient to hold any jobs.

$($e$)$ Each job has mixture of CPU and I$/$O instructions, and the integer between the

brackets indicates CPU or I$/$O cycle required for each instruction $($Please refer to

the job list assigned to your group$).$

Example:

CPU $(20)$ The integer $20$ represents the computational instruction requires $20$

CPU cycle to compute.

I$/$O $(40)$ The integer $40$ represents the I$/$O instruction requires $40$ CPU cycle to

complete