Explain Multilevel Queue Scheduling

Q1. Explain Multilevel Queue Scheduling.

Ans. This algorithm is created for situation in which processes are easily classified into different groups. Ready queue is partitioned into separate queues and each queue has separate queues and each queue has its own scheduling algorithm.

For example, separate queues might be used for:

  1. Foreground (interactive) processes: Round Robin
  2. Background (batch) processes: FCFS

These two types of processes have different response time requirements and so may have different scheduling needs. The processes are permanently assigned to one queue, generally based on some property of the processes, such as memory size, process priority or process type.

Leave a Reply

Your email address will not be published. Required fields are marked *

%d bloggers like this: