Scribd
Upload
4 views1 page

Scheduling Practice Question

The document outlines the specifications for a multilevel feedback queue with three priority levels (Q0, Q1, Q2) and their respective scheduling algorithms. It details the execution and demotion rules for processes within these queues, as well as the process attributes such as CPU burst, I/O burst, base priority, and arrival time. Additionally, it includes tasks for drawing a Gantt chart, calculating waiting times, and determining normalized turnaround times for the processes listed.

Uploaded by

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

Scheduling Practice Question

The document outlines the specifications for a multilevel feedback queue with three priority levels (Q0, Q1, Q2) and their respective scheduling algorithms. It details the execution and demotion rules for processes within these queues, as well as the process attributes such as CPU burst, I/O burst, base priority, and arrival time. Additionally, it includes tasks for drawing a Gantt chart, calculating waiting times, and determining normalized turnaround times for the processes listed.

Uploaded by

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

Question

Assume a multilevel feedback queue with the following specifications.


Number of queues: 3 - [Q0, Q1 and Q2 where Q0 is the highest priority queue
and Q2 is the lowest priority queue]
Scheduling algorithm used in Queue:
Queue Q0: This queue uses the Fair share scheduling algorithm. Once selected,
a process will get maximum 20 time units of execution from Q0. After 20 time
units of execution the currently executing process is moved to Q1.
Queue Q1: This queue uses the Round Robin scheduling algorithm with a time
quantum of 30 time units. After 30 time units of execution the currently
executing process is moved to Q2.
Queue Q2: This queue uses Shortest Remaining Time First (SRTF) scheduling
algorithm. The remaining execution time of the process when it arrives at Q2 is
considered.
Method used to upgrade a process No upgrading among queues.
Method to demote a process
Q0→ A process in Q0 will be demoted to Q1 once it finishes 20 units of execution
from Q0. Q1→ A process in Q1 will be demoted to Q2 once it finishes 30 units of
execution from Q1.
Q2→ No demotion from Q2.
Method used to determine which queue a process will enter
All the processes (newly created processes and the processes returning from
blocked state) will join Q0 only.
If processor is executing a process from a lower priority queue and a new process
arrives at a higher priority queue, then the executing process will be preempted
and the processor will start executing process from the higher priority queue.

Process Group CPU burst and I/O burst Details Base Priority Arrival time
P1 G1 100 Units of CPU 38 0
50 Units of CPU followed by 30 units
P2 G1 35 0
of I/O followed by 60 units of CPU
P3 G2 140 Units of CPU 42 20
60 Units of CPU followed by 90 units
P4 G3 40 40
of I/O followed by 50 units of CPU
20 Units of CPU followed by 120 units
P5 G3 39 40
of I/O followed by 20 units of CPU

(A) Draw the resultant Schedule (Gantt chart)


(B) Find the waiting time of each process
(C) Find the Normalized turnaround time of each process
Submission:
Hard Copy [Hand written] in Report format [First Page Your Name, ID, Course
No, Course Name, …..]

You might also like