What is Multiple-Level Queues Scheduling?
This algorithm separates the ready queue into various separate queues. In this method, processes are assigned to a queue based on a specific property of the process, like the process priority, size of the memory, etc.
However, this is not an independent scheduling OS algorithm as it needs to use other types of algorithms in order to schedule the jobs.
Characteristics of Multiple-Level Queues Scheduling
- Multiple queues should be maintained for processes with some characteristics.
- Every queue may have its separate scheduling algorithms.
- Priorities are given for each queue.
Advantages
- The processes are permanently assigned to the queue, so it has advantage of low scheduling overhead.
Disadvantages
- Some processes may starve for CPU if some higher priority queues are never becoming empty.
- It is inflexible in nature.