Multilevel feedback queue scheduling

This form of process scheduling gives priority to shorter jobs. For example, processes that last less then 8 ms may be put into queue 0, process that are between 8 and 16 ms will be put into queue 2, quue three may get all the process that are longer then 16 ms. The result is, it leaves I/O bound processes in the higher level of the queue and cpu bound processes in the lower levels of the queue. The MFQS is the most general scheduling algorithm.

multi-level feedback queues are specified by the following parameters:
- number of queues
- scheduling algo for each queue
- method used to upgrade or demote a process from level to another