Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

What I need help with is the rest of Partial Gantt Chart MLFQ to 147 time units & Calculations for the MLFQ partial Gantt chart

What I need help with is the rest of Partial Gantt Chart MLFQ to 147 time units & Calculations for the MLFQ partial Gantt chart (147 time units)

image text in transcribedimage text in transcribedimage text in transcribed

5. Partial Gantt chart for MLFQ 147 a. MLFQ video to help you get started: https://youtu.be/aclTbxTyMWk e the PARTIALresultsforgetsstanseTimeunoutubeacITbRTVMwk 6. Calculate the PARTIAL results for Response Time (RT), Waiting Time (WT), Turnaround Time (TT) PER PROCESS and Averages as of time 147 for MLFQ 2. MLFQ Multilevel Feedback Queue (preemptive - absolute priority in higher queues) Queue 1 uses RR scheduling with Tq 4 Queue 2 uses RR scheduling with Tq 9 Queue 3 uses FCFS All processes enter first queue 1. If time quantum (Tq) expires before CPU burst is complete, the process is downgraded to next lower priority queue. Processes are not downgraded when preempted by a higher queue level process. Once a process has been downgraded, it will not be upgraded. Assumptions: 1. All processes are activated at time 0 2. Assume that no process waits on IO devices 3. After completing an IO event, a process is transferred to the ready queue 4. Waiting time is accumulated while a process waits in the ready queue 5. Turnaround time is a total of (Waiting time) +(CPU burst time) + (IO time) 6. Response time is the first measure of waiting time from arrival at time 0 until the first time on the CPU Process Data: process goes {CPU burst, I O time, CPU burst, IO time, CPU burst, IO time,., last CPU burst) P1 (4, 27, 3, 31, 2, 43, 4, 18, 4, 22, 4, 26, 3, 24, 4 P2 (16, 24, 17, 21, 5, 36, 16, 26, 7, 31, 13, 28, 11, 21, 6, 13, 3, 11, 4 } P3 (8, 33, 12, 41, 18, 65, 14, 21, 4, 61, 15, 18, 14, 26, 5, 31, 6 P4 (3, 35, 4, 41, 4, 45, 3, 51, 4, 61, 3, 54, 6, 82, 5, 77, 3 j P5 4, 48, 5, 44, 7, 42, 12, 37, 9, 46, 4, 41, 9, 31, 7, 43, 8 P6 (11, 22, 4, 8, 5, 10, 6, 12, 7, 14, 9, 18, 12, 24, 15, 30, 8 P7 (14, 46, 17, 41, 11, 42, 15, 21, 4, 32, 7, 19, 16, 33, 10 P8 (4, 14, 5, 33, 6, 51, 14, 63, 16, 87, 6, 74, 7 P9 13, 37, 9, 41, 8, 30, 4, 29, 7, 33, 5, 22, 4, 24, 5, 29, 16 ) 3 FCFS P2 P3 P6 CPU CPU CPU CPU CPU CPU CPU 83 12 41 5o 18 65 14 21F9D 3 51 4 61 15 18 14 26 17 41 5 36 30 18 4 22 4 26 14 63 16 87 74 4 61 7 31 13 28 11 21 6 1 3 11 32 19 16 33 14 41 31 43 9 18 6 8 5 77 15 30 10 16 4 12 ,5 19-307 313137 ys 49 50 54 61 6771 73 Pathal-PH-I MODULE 6- By HAND Tm 14T WT ITT 5. Partial Gantt chart for MLFQ 147 a. MLFQ video to help you get started: https://youtu.be/aclTbxTyMWk e the PARTIALresultsforgetsstanseTimeunoutubeacITbRTVMwk 6. Calculate the PARTIAL results for Response Time (RT), Waiting Time (WT), Turnaround Time (TT) PER PROCESS and Averages as of time 147 for MLFQ 2. MLFQ Multilevel Feedback Queue (preemptive - absolute priority in higher queues) Queue 1 uses RR scheduling with Tq 4 Queue 2 uses RR scheduling with Tq 9 Queue 3 uses FCFS All processes enter first queue 1. If time quantum (Tq) expires before CPU burst is complete, the process is downgraded to next lower priority queue. Processes are not downgraded when preempted by a higher queue level process. Once a process has been downgraded, it will not be upgraded. Assumptions: 1. All processes are activated at time 0 2. Assume that no process waits on IO devices 3. After completing an IO event, a process is transferred to the ready queue 4. Waiting time is accumulated while a process waits in the ready queue 5. Turnaround time is a total of (Waiting time) +(CPU burst time) + (IO time) 6. Response time is the first measure of waiting time from arrival at time 0 until the first time on the CPU Process Data: process goes {CPU burst, I O time, CPU burst, IO time, CPU burst, IO time,., last CPU burst) P1 (4, 27, 3, 31, 2, 43, 4, 18, 4, 22, 4, 26, 3, 24, 4 P2 (16, 24, 17, 21, 5, 36, 16, 26, 7, 31, 13, 28, 11, 21, 6, 13, 3, 11, 4 } P3 (8, 33, 12, 41, 18, 65, 14, 21, 4, 61, 15, 18, 14, 26, 5, 31, 6 P4 (3, 35, 4, 41, 4, 45, 3, 51, 4, 61, 3, 54, 6, 82, 5, 77, 3 j P5 4, 48, 5, 44, 7, 42, 12, 37, 9, 46, 4, 41, 9, 31, 7, 43, 8 P6 (11, 22, 4, 8, 5, 10, 6, 12, 7, 14, 9, 18, 12, 24, 15, 30, 8 P7 (14, 46, 17, 41, 11, 42, 15, 21, 4, 32, 7, 19, 16, 33, 10 P8 (4, 14, 5, 33, 6, 51, 14, 63, 16, 87, 6, 74, 7 P9 13, 37, 9, 41, 8, 30, 4, 29, 7, 33, 5, 22, 4, 24, 5, 29, 16 ) 3 FCFS P2 P3 P6 CPU CPU CPU CPU CPU CPU CPU 83 12 41 5o 18 65 14 21F9D 3 51 4 61 15 18 14 26 17 41 5 36 30 18 4 22 4 26 14 63 16 87 74 4 61 7 31 13 28 11 21 6 1 3 11 32 19 16 33 14 41 31 43 9 18 6 8 5 77 15 30 10 16 4 12 ,5 19-307 313137 ys 49 50 54 61 6771 73 Pathal-PH-I MODULE 6- By HAND Tm 14T WT ITT

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Beginning C# 5.0 Databases

Authors: Vidya Vrat Agarwal

2nd Edition

1430242604, 978-1430242604

More Books

Students also viewed these Databases questions