• Multilevel feedback queue-scheduling algorithm enables a process to move among queues. It uses a number of ready queues and acquaintances a dissimilar priority with every queue.
• The Algorithm chooses to process with highest priority from the occupied queue and run that process either preemptively or nonpreemptively.
• If the process uses in excess of CPU time it will moved to a lower-priority queue. Likewise, a process that waits too long in the lower-priority queue may be moved to a higher-priority queue. Note that this form of aging avoids starvation.