$100$ marks

Given the MLFQ scheduling rules, process information and queue information below, fill in the blanks

of Scheduling result table.

$(1)$ Rules

Rule $1$: If Priority$($A$)>$ Priority$($B$),$ A runs $($B doesn't$).$

Rule $2$: If Priority$($A$)=$ Priority$($B$),$ A & B run in round$-$robin fashion using the time

slice $($quantum length$)$ of the given queue.

Rule $3$: When a job enters the system, it is placed at the highest priority $($the topmost

queue$).$ For the jobs arriving at the same time, schedule the job with smallest pid first.

Rule $4$: Once a job uses up its time allotment at a given level $($regardless of how many

times it has given up the CPU$),$ its priority is reduced $($ie$.,$ it moves down one queue

and will be at the tail of the target queue, which means it will be scheduled last$).$

Rule $5$: After some time period S$,$ move all the jobs in the system to the topmost queue,

and sort all the jobs by pid. The job with the largest pid will be scheduled first.

Note: Sorting will happen every time it amives the Period S$.$

$(2)$ Process information

ProcessNum $6$

pidnum:$53,$ anival$\_$time: $10,$ execution$\_$time: $130$

pidnum:$165,$ arrival$\_$time: $10,$ execution$\_$time: $125$

pidnum:$472,$ anival$\_$time: $80,$ execution$\_$time: $128$

pidnum:$305,$ anival$\_$time: $90,$ execution$\_$time $90$

pidnum:$235,$ arrival$\_$time: $175,$ execution$\_$time: $85$

pidnum:$366,$ arrival$\_$time:$445,$ execution$\_$time: $80$

$(3)$ Queue information

QueueNum $3$

Period$\_$S $400$

Time$\_$Slice$\_$Q$310$ Allotmenttime$\_$Q$330$

Time$\_$Slice$\_$Q$250$ Allotmenttime$\_$Q$2100$

Time$\_$Slice$\_$Q$160$ Allotmenttime$\_$Q$1120$

Scheduling result table: