[solved]-Analyze Performance Three Scheduling Mechanisms Exponential Averaging Mlfq True Shortestre Q38994626

Analyze the performance of three scheduling mechanisms:Exponential Averaging, MLFQ, and true ShortestRemainingTimeFirst(SRTF). True SRTF pre-empts after a time quantum of 3, thepre-empted process remains in the ready queue and now has a shorterremaining time. Calculate the Average Completion Time AND count thenumber of context switches. The workload consists of the following:P1: 9(3,2,4); P2: 8(2,6); P3: 16(2,4,6,4). I/O between bursts for 4time quantums, multiple processes can do concurrent I/O. Exp Avedefault =2, alpha=0.6. No pre-emption. True SRTF, pre-empt after 3,remain in ready queue.
MLFQ: 3 queues of 2,4 and 8 quantums for thequeues. Processes are executed in FIFO order within each queue. Nopre-emption. Time Exec Ready P1
P2
P3 I/O:4 Ave completion time =Time Q1:2 Q2:4 Q3:8 Q1 Q2 Q3 IO:4 Ave Competion Time =.
True SRTFwith pre-emption, quantum=3: Time 0 Executing
ReadyQ P1:3 P2:2 P3:2I/O:4 Completion time ave = P 4 times of CPU idle. Context switches= Context switches= 7 times of CPU idle. context switches. Exp Ave(initial pred=2, alpha =0.6) MLFQ: Executing in Queues

Expert Answer

---

Answer to Analyze the performance of three scheduling mechanisms: Exponential Averaging, MLFQ, and true ShortestRemainingTimeFirst… . . .