PPT Slide
Multi-level queues
- Can extend to 3 queues that have variable parameters determining the job flow between the queues (Figure 8.7).
- Dispatcher will select a job in Queue 1, else Queue 2 else finally Queue 3.
- Let q1, q2 and q3 represent the time quantum per queue.
- Let n1 = number of times a process can go through Queue 1 before being demoted to Queue 2. Let n2 do the same between Queue 2 and 3.
- If n1 and q1 are infinite, FCFS.
- If n1 is infinite and q1 is finite, Round Robin.
- If n1 & q1 are finite, have two-queue system (etc.)
-