Question
Analyze the performance of three scheduling mechanisms: Exponential Averaging, MLFQ, and true ShortestBurstFirst . Calculate the Average Completion Time AND count the number of context
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: 9(3,2,4); P2: 8(2,6); P3: 17(2,4,5,6). I/O between bursts for 4 time quantums. Exp Ave default =2, alpha=0.6
MLFQ: 3 queues of 2,4 and 8 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 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| P2 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| P3 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| I/O:4 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| MLFQ: Executing in Queues | |||||||||||||||||||||||||
| Time | 0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Q1:2 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Q2:4 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Q3:8 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| MLFQ: In Queues | |||||||||||||||||||||||||
| Q1 | 1,2,3 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Q2 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Q3 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| IO:4 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ave Competion Time = context switches =
True SJF:
| Time | 0 |
|
|
|
|
|
|
|
|
|
|
|
|
| Executing |
|
|
|
|
|
|
|
|
|
|
|
|
|
| ReadyQ | 1,2,3 |
|
|
|
|
|
|
|
|
|
|
|
|
| I/O:4 |
|
|
|
|
|
|
|
|
|
|
|
|
|
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Constraint Databases And Applications Second International Workshop On Constraint Database Systems Cdb 97 Delphi Greece January 1997 Cp 96 Workshop On Constraints And Databases Cambridge Ma Usa August 1996 Selected Papers Lncs 1191
Authors: Volker Gaede ,Alexander Brodsky ,Oliver Gunther ,Divesh Srivastava
1st Edition
3540625011, 978-3540625018
