Question: Please help me with the assignment below the example. This is an example of prior assignment. Are you able to reference it to complete MLFQ.
Please help me with the assignment below the example.
This is an example of prior assignment. Are you able to reference it to complete MLFQ.
P1: 10(3,2,5); P2: 4(2,2); P3: 16(2,3,5,6). I/O for 2 time quantums.
Time Exec
P1 2 P22 2 P32 22.64.04
Time Q1:1 Q2:2 Q3:4
0
1
2
3
5 P1 P2 P3
7
8
Executing in Queues
9 10 11 12 14 15 17 18 20 22 24 26 27 29 32
0 3 5 7 9 12 14 19 24 30 P1:3 P2:2 P3:2 P2:2 P3:3 P1:2 P3:5 P1:5 P3:6
Q1 1,2,31,2,32,3
2 3 1 1 1,2 1,2,32,3 3
Q2 Q3 IO:2
1
1,2 1,2,32,3 3 1 1,2
2.6 2.24
I/O:2 P1 P2 P3
Ave completion time = 9 + 24 + 30
P3 P1
= 63 / 3 = 21
P3
P2
P1
P2
P3
P1
1 2,3
P3 P1 P1 P2 P3
In Queues
P3 P1 P3
3 1 3
Idle
P3
3 3
6
Exp AEvxecSucthinegdu(liinnigtia(linpirteiadl=p2r,eadl=p2h,aa=lp0h.6a)=0.6)
1 1 1,3 3 311333
Ave Completion Time = P1 (22) + P2(12) + P3(32) = 66 /3 = 22. Worse than ExpAve (21), with the 2 time when CPU was idle. Just for fun, I looked at the number of context switches (overhead): Exp Ave = 9. MLFQ= 17 Also for completeness, I looked at true SJF:
Time 2 4 6 9 12 14 19 24 30 P2:2 P3:2 P2:2 P1:3 P3:3 P1:2 P3:5 P1:5 P3:6
I/O:2 P2 P3 P1 P3 P1 P3 Completion time ave = P1(24) + P2(6) + P3(30) = 60 /3 == 20. Context switches = 9. Exp Ave was close to true SJF.
P1 P3
P3
P3
3
Hello,
Is it possible for the same person that assisted me with the similar problem/topic below on July 6, assist me again with the one below. If someone else will assist, please ensure 100% accuracy and confident answer is accurate. Thanks so much.
Page 1.
Analyze the performance of three scheduling mechanisms: Exponential Averaging, MLFQ, and true ShortestBurstFirst. Calculate the Average Completion Time AND count the number of context switches. The workload consists of the following:
P1: 10(3,2,4); P2: 4(2,6); P3: 16(2,4,5,6). I/O between bursts for 4 time quantums. Exp Ave default =2, alpha=0.6
MLFQ: 3 queues of 2,3 and 4 quantums for the queues. Processes are executed in FIFO order within each queue.
| Executing (initial pred=2, alpha =0.6) | |||||||||||||||||||||||||
| Time | 0 | ||||||||||||||||||||||||
| Exec | |||||||||||||||||||||||||
| Ready | 1,2,3 | ||||||||||||||||||||||||
| P1 | 2 | ||||||||||||||||||||||||
| P2 | 2 | ||||||||||||||||||||||||
| P3 | 2 | ||||||||||||||||||||||||
| I/O:4 | |||||||||||||||||||||||||
Ave completion time = Context switches =
| MLFQ: Executing in Queues | |||||||||||||||||||||||||
| Time | 0 | ||||||||||||||||||||||||
| Q1:1 | |||||||||||||||||||||||||
| Q2:2 | |||||||||||||||||||||||||
| Q3:4 | |||||||||||||||||||||||||
| MLFQ: In Queues | |||||||||||||||||||||||||
| Q1 | 1,2,3 | ||||||||||||||||||||||||
| Q2 | |||||||||||||||||||||||||
| Q3 | |||||||||||||||||||||||||
| IO:4 | |||||||||||||||||||||||||
Ave Completion Time = Context switches =
True SJF:
| Time | 0 | |||||||||||||
| Executing | ||||||||||||||
| ReadyQ | 1,2,3 | |||||||||||||
| I/O:4 |
Completion time ave = . Context switches =
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
