Documente Academic
Documente Profesional
Documente Cultură
created for situations in which processes are easily classified into different groups.
For example, a common division is made between
a number of multiple queues which are divided depending upon the type of processes that are required to be scheduled.
Batch Processes: Those which do not require human
interaction while performing its run, they run without human intervention.
from users and which interact with the system and user maximum time.
CPU Bound Processes
I/O Bound Processes Real Time Processes
generally based on some property of the process, such as memory size, process priority or process type.
example, separate queues might be used for foreground and background processes.
The foreground queue might be scheduled by an RR
You have several queues, each has a level which corresponds to a level of priority.
Queue 1: High Priority, Shortest Job First Queue 2: Medium Priority, Round-Robin 10ms Quantum Queue 3: Low Priority, Round Robin 100 ms Quantum Then overall queue could be a priority queue.
So Q1 gets 50% of CPU time, Q2 gets 35% of the CPU
interactive editing process was running, the interactive editing process would be preempted.
processes can move from one queue to another queue but in MLQ scheduling processes are assigned to a fixed queue
A process can move between various queues; aging can
to lower-priority queues. This leaves I/O bound and interactive processes in the higher-priority queues.
In general, the multilevel feedback queue scheduling
following parameters:
number of queues scheduling algorithms for each queue method used to determine when to upgrade a process method used to determine when to demote a process method used to determine which queue a process will
When it gains CPU, job receives 8 milliseconds If it does not finish in 8 milliseconds, job is moved to queue Q1
milliseconds