Scheduling Algorithms

5. Multilevel Queue Scheduling.
   • If the processes that run on a device can be grouped into clear categories, we could have a different scheduling algorithm for each group.
   • Every group of processes will be dedicated its own queue (hence the name "Multilevel Queue" algorithm.)
   • The Scheduler will also need to schedule the activity between the queues (that is, the processes of which queue run first.)
   • In this algorithm, a process cannot move from one queue to another: it is fixed to a particular queue.
   • Advantage: Scheduling could be more granulated: we will 'match' the best algorithm in each group's queue based on the traits of the processes in that group.
   • Disadvantage: It might be challenging to decide to which group a process will belong. Also, the implementation of this algorithm could be complicated since we need to both schedule processes within a queue and between queues.