Question

Assume a dynamic queue which is serviced by a Priority Based Round Robin algorithm such that there exists three priorities (1,2,3) which are used as multipliers of the basic time quantum value with the resulting number being the maximum service time the corresponding job will receive each time it gets the CPU. For a maximum amount of time equal to 1 basic time quantum , a priority 2 job gets the CPU for the maximum amount of time equal to whatever 2 times the basic time quantum is, and a priority 3 job gets the CPU for the maximum amount of time equal to whatever 3 times the time quantum is. Of course, a job may terminate before its allocated amount of time expires. Since the queue is dynamic, jobs will have different arrival times.

nonpreemptive priority: scheduling algorithm will simply put the new process at the head of the ready queue

This question is Nonpreemptive Round Robin based priority.

Each process is being multiplied by the quantum basic time = 2

1.  P1= 2*1=2

2. P2= 2*2=4

3. P3= 3*2=6

Because the queue is dynamic then jobs will arrive at different timing. If two jobs are arriving on same time which is possible, the one highest priority gets placed in the queue first. (We will ignore the case of equal priorities AND equal arrival times)

Shortest job forgets about priority.

The first 3 questions you have to use Round Robin priority. Then you have to repeat those three questions for question 4 using Shortest Job First and Longest Job First, the answers the questions

1. Show a Gantt Chart showing how the queue is serviced to the completion of all jobs

2. Compute the waiting time And the turnaround time for EACH job in the queue

3. Compute the average waiting time And the average turnaround time associated with servicing the queue.

4) Compare the results obtained in the questions 1-3 with servicing queue strictly on a shortest job first basis. REMEMBER THE ARRIVAL TIMES. What are your observations and why? Is it true that since no algorithm performs better than Shortest Job First, no algorithm performs worse than Longest Job First? Prove your answer.

Process	length	Priority	ArrivalTime
P1	5	2	0
P2	8	3	1
P3	3	1	5
P4	10	3	2
p5	2	1	1
p6	5	1	2

Answer 1

yRourd on rt CYYI Time Banc Time Time P3 ST ps 1 0 3 5 1 2 6 2 0 22 27 42 3 3 ру 23 33 GanHat Round Pobinpidity irne usin proces 27 2.3 3 1 Ps 2 3 PST lime CSI scanne CamScanner

36 Ans 62 wn) 6 80 1 Tanasoord Time 113 18.8 33 MRec canned with CamScanner

Shortest Job font ;- Toin oond ceengva tirg Tirre 2 3 Pu o P6 Ps 2 2. 5 2 1 0 i S 1O Gant chasst: o 3 1S 13 33 9.66ヲ -6- Tinaxard Tine canne Sc

arge rve 0 2 3 2 S 19 P S 1 2 P6 19 2.4 P3 2-8 fola. 1147 Grantt che 12 9 24 28 31 33 쁘-19 min. A-3 ① loaehT9 post: Auq.cou tin Thm: Iya mu c Scanned with