Please answer accurately and claarly.... #1. Analyze the performance of three sc
ID: 3856319 • Letter: P
Question
Please answer accurately and claarly....
#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 = .
Executing (initial pred=2, alpha =0.6)
Time
0
Exec
Ready
1,2,3
P1
2
P2
2
P3
2
I/O:4
Explanation / Answer
Describe the differences among short-term, medium-term, and long-term scheduling.
4.6. Describe the actions taken by a kernel to switch context
(a) Among threads
(b) Among processes
4.7. What are the differences between user-level threads and kernel-supported threads? Under what circumstances is one type "better" than the other?
Describe the differences among short-term, medium-term, and long-term scheduling.
4.6. Describe the actions taken by a kernel to switch context
(a) Among threads
(b) Among processes
4.7. What are the differences between user-level threads and kernel-supported threads? Under what circumstances is one type "better" than the other?
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.