A

PROJECT REPORT
ON
“Multilevel Queue and Multilevel Feedback Queue
Scheduling”
Subject – Operating System (22516)

SUBMITTED BY
106-Lanke Gauri Arvind (2100340213)

Under the guidance of

Mrs. S. Mohanapriya

DEPARTMENT OF COMPUTER TECHNOLOGY

Sanjivani Rural Education Society’s
SANJIVANI K.B.P POLYTECHNIC
KOPARGAON-423603, DIST-AHMEDNAGAR
(2023-2024)

1
 Sanjivani Rural Education Society’s
SANJIVANI K.B.P POLYTECHNIC
DEPARTMENT OF COMPUTER TECHNOLOGY

CERTIFICATE
This is to certify that the Project report entitled
“Multilevel Queue and Multilevel Feedback Queue
Scheduling”
Submitted By
106-Lanke Gauri Arvind (2100340213)

Under our supervision and guidance for partial fulfillment of

the requirement for
Diploma in Computer Technology affiliated to
Maharashtra State Board of Technical Education,
Mumbai For academic year 2023-2024

Mrs. S. Mohanapriya Prof G.N. Jorvekar Prof. A. R. Mirikar

PROJECT GUIDE HOD PRINCIPAL

2
 ACKNOWLEDGEMENT

I would like to express my special thanks of gratitude to

my teacher Mrs. S. Mohanapriya who gave me the golden
opportunity to explore myself and improve my skills by
performing this project. Secondly, I would like to thanks to
our HOD of computer department Mr. G.N.Jorvekar for their
kind help ,guidance and motivation .I would also like to
express my gratitude to the Principal Mr. A.R.Mirikar for
providing us with all facility that were required. Last but not
the least, I would like to thanks our friends and co-member
who helped us in each and every possible way.

- Lanke Gauri Arvind (2100340213)

3
 INDEX

SR.NO TITLE PAGE NO

1. Introduction 5
2. Multilevel Queue Scheduling 6-7
3. Multilevel Feedback Queue 8-9
Scheduling
4. Conclusion 10
5. References 11

4
 INTRODUCTION

In the complex landscape of operating systems, efficient process

scheduling is crucial for maximizing system performance. Two vital
algorithms that address this challenge are Multilevel Queue
Scheduling and Multilevel Feedback Queue Scheduling. Multilevel
Queue Scheduling organizes processes into multiple priority queues,
each with its own scheduling algorithm. This approach ensures that
tasks with varying levels of importance receive appropriate attention,
enhancing overall system responsiveness. On the other hand,
Multilevel Feedback Queue Scheduling takes a dynamic approach,
allowing processes to migrate between different queues based on their
behavior and execution patterns. This adaptability ensures that
interactive tasks receive quick responses while long-running
processes do not monopolize resources indefinitely.In this project, we
delve into the intricacies of these scheduling algorithms, exploring
their advantages, disadvantages, and real-world applications. By
understanding the Multilevel Queue and Multilevel Feedback Queue
Scheduling, we gain valuable insights into how operating systems
manage tasks, thereby optimizing system efficiency and user
experience.

5
 MULTILEVEL QUEUE SCHEDULING

The kind of scheduling that can be used in the situations where

processes can be classified into different groups is known as
Multilevel Queue Scheduling. One example may be considered as
division between foreground processes (interactive) and background
processes (batch). Both these groups have different response time
requirements. Also, foreground processes may have priority over
background processes.
Multilevel queue scheduling algorithm partitions the ready queue
in multiple queues and processes are permanently assigned to any
queue based on some properties of the process as memory size,
priority, process type etc. Every queue has its own scheduling
algorithm. (e.g. RR algorithm for foreground processes and FCFS for
background processes). In addition to this, foreground queue may
have absolute priority over background queue.

EXAMPLE-

6
Multilevel queue scheduling algorithm in the above figure has
partitioned the ready queue in multiple queues as,

 System Processes: The OS has its process to execute, which is

referred to as the System Process.
 Interactive Processes: It is a process in which the same type of
interaction should occur.
 Interactive Editing Processes
 Batch Processes: Batch processing is an operating system
feature that collects programs and data into a batch before
processing starts.
 Student Process: The system process is always given the highest
priority, whereas the student processes are always given the
lowest.
Each queue has absolute priority over lower priority queue. e.g. If a
system process is entered in ready queue while a batch process is
running, then batch process is preempted.

There are various advantages and disadvantages of multilevel queue

scheduling. Some of the advantages and disadvantages of the
multilevel queue scheduling are as follows:

ADVANTAGES:
1. You can use multilevel queue scheduling to apply different
scheduling methods to distinct processes.
2. It will have low overhead in terms of scheduling.

DISADVANTAGES:
1. There is a risk of starvation for lower priority processes.
2. It is rigid in nature.

7
 MULTILEVEL FEEDBACK QUEUE SCHEDULING

In Multilevel Queue Scheduling algorithm, processes are not

allowed to move from one queue to another. So it is inflexible. In
Multilevel Feedback Queue Scheduling processes are allowed to
move from one queue to another. System Processes Interactive
Processes Interactive Editing Processes Batch Processes Student
Processes Highest Priority Lowest Priority In this algorithm ready
processes are separated into multiple queues on the basis of their CPU
bursts. If a process requires more CPU time, it is moved to lower
priority queue. Priority decreases from upper layer to lower layer.
Time slice of upper layer is always lesser than the lower one.

EXAMPLE-

Figure shows one example of multilevel feedback queues. A

process which has become ready is put in queue 0. Processes in queue
0 are given a time quantum of 8 milliseconds. If the process does not
finish within this quantum it is added at the tail of queue 1. If queue 0
is empty, process from head of queue 1 is given time quantum of 16
milliseconds. Even after this time quantum if the process is not
finished, it is moved to queue 2 which uses FCFS scheduling when

8
queue 0 and queue 1 are empty. i.e. each time, the time slice is
increased but priority is decreased for the process.
In general, a multilevel feedback queue scheduler is defined by the
following parameters:

 The number of queues.

 The scheduling algorithm for each queue.
 The method used to determine when to upgrade a process to a
higher-priority queue.
 The method used to determine when to demote a process to a
lower-priority queue.
 The method used to determine which queue a process will enter
when that process needs service.

There are various advantages and disadvantages of multilevel

feedback queue scheduling. Some of the advantages and
disadvantages of the multilevel queue scheduling are as follows:

ADVANTAGES:
1. This is a flexible Scheduling Algorithm
2. This scheduling algorithm allows different processes to move
between different queues.
3. In this algorithm, A process that waits too long in a lower
priority queue may be moved to a higher priority queue which
helps in preventing starvation.

DISADVANTAGES:
1. This algorithm is too complex.
2. As processes are moving around different queues which leads to
the production of more CPU overheads.
3. In order to select the best scheduler this algorithm requires some
other means to select the values.

9
 CONCLUSION

In the realm of operating systems, the study of Multilevel Queue

and Multilevel Feedback Queue Scheduling has provided invaluable
insights into the intricate art of process management. Through our
exploration, we have unraveled the dynamic nature of these
algorithms, understanding how they balance the often-conflicting
demands of responsiveness, fairness, and system throughput. As we
conclude this project, it becomes evident that the knowledge gained
here is not just theoretical but forms the backbone of modern
operating systems. These scheduling techniques, with their real-world
applications in interactive systems, real-time processing, and time-
sharing environments, are foundational to creating robust, responsive,
and equitable computing experiences. By comprehending the nuances
of these algorithms, we pave the way for the continued evolution of
operating systems, ensuring that they meet the ever-growing demands
of contemporary computing challenges.

10
 REFERENCES

1. https://www.studytonight.com/operating-
system/multilevel-feedback-queue-scheduling

2. https://www.javatpoint.com/multilevel-queue-
scheduling-in-operating-system

11