Multilevel queue scheduling





Multilevel queue scheduling
Multi level queue scheduling was created for situation in which processes are easily classified into different groups.

Multilevel queue scheduling has the following characteristics:

  • Processes are divided into different queue based on their type. Process are permanently assigned to one queue, generally based on some property of process i.e. system process, interactive, batch system, end user process, memory size, process priority and process type.
  • Each queue has its own scheduling algorithm. For example interactive process may use round robin scheduling method, while batch job use the FCFS method.

In addition, there must be scheduling among the queue and is generally implemented as fixed priority preemptive scheduling. Foreground process may have higher priority over the background process

multilevel queue scheduling

multilevel queue scheduling

No process in the batch queue could run unless the queue for system processes and interactive processes were all empty. If an interactive process enters the ready queue while a batch process was running, the batch would be preempted



Related posts:

  1. Processes Scheduling queue As processes enter the system they put in job queue....
  2. Scheduling Introduction Scheduling is the process of determining which processes will...
  3. Round robin scheduling Round Robin Scheduling The basic purpose of this algorithm is...
  4. Shortest job first scheduling Shortest job first scheduling Key concept of this algorithm is:...
  5. Shortest Remaining Time Scheduling Shortest remaining time (SRT) scheduling Shortest remaining time scheduling is...