Scribd
Upload
4 views1 page

Multilevel Feedback Queue Scheduling Tutorial

Uploaded by

f20220233
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views1 page

Multilevel Feedback Queue Scheduling Tutorial

Uploaded by

f20220233
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Tutorial 3

Q1. Consider a multilevel feedback queue with three ready queues Q1, Q2 and Q3 and
five processes. Priority of Q1 > Priority of Q2 > Priority of Q3. Q1 employs Round Robin
scheduling with time quantum = 6 milliseconds. Q2 employs Round Robin scheduling
with time quantum = 12 milliseconds. Q3 uses FCFS scheduling. Pre-emptive priority
scheduling is used for scheduling across the queues.
Process Arrival time at Q1 Burst time (ms)
(ms)
P1 0 30
P2 8 20
P3 16 16
P4 24 8

Draw the Gannt chart showing the execution of the processes. Also find the completion
time of all the processes.
Q2. Consider the following set of processes with the indicated arrival time. The length of
the CPU burst time is given in milliseconds. Draw the Gantt chart and compute the
average waiting time of these processes execution using multilevel feedback queue
scheduling with time quantum of Q0 as 3msec, time quantum of Q1 is 6msec and Q2
uses FCFS scheduling
Proces Arrival time Burst time
s
P1 0 12
P2 2 9
P3 4 1
P4 6 5
P5 10 3

You might also like