Application on

Multilevel queue
scheduling
TEAM NO:6
----------
MARA SRIKAR (20071A1234)
RAJULA SAI KIRAN (20071A1254)
Subject : Operating systems THUMMANAPALLY VOMANN (20071A1258)
VALLAPUREDDY PRANITHA (20071A1260)
Faculty : CH KAMALA
abstract:
A multi-level queue scheduling algorithm partitions the ready queue into several separate
queues. The processes are permanently assigned to one queue, generally based on some
property of the process, such as memory size, process priority, or process type. Each
queue has its own scheduling algorithm.we are using c++ language to implement this
algorithm.
Existing solution:

● It may happen that processes in the ready queue can be divided into different classes
where each class has its own scheduling needs. For example, a common division is a
foreground (interactive) process and a background (batch) process. These two classes
have different scheduling needs. For this kind of situation Multilevel Queue
Scheduling is used.
● Scheduling all the process is very difficult using a single queue.
● As it is has only single queue space is limited.
● Less performance .
Proposed solution:
● The ready queue is partitioned into 2 queues based on processes types.
● Each queue has its own scheduling algorithm SJF and FCFS respectively.
● Each queue has absolute priority over the lower priority queue.
● Queue with higher priority executes first , after all the processes in that queue
complete their execution ,the next priority queue starts executing its processes.
● Using this we can efficiently manage large no of processes without any constraint on
the space requirement.
Implementation
Implementation
Implementation
Implementation
Conclusion
Scheduling all the process is very difficult using a single queue as space is limited and
results in less performance .

Therefore Multi level queue scheduling can be used to efficiently manage large no of
processes without any constraint on the space requirement and also enhance performance.
Thank you