Multilevel_feedback_queue
Multilevel feedback queue
Processing scheduling algorithm
In computer science, a multilevel feedback queue is a scheduling algorithm. Scheduling algorithms are designed to have some process running at all times to keep the central processing unit (CPU) busy.[1] The multilevel feedback queue extends standard algorithms with the following design requirements:
- Separate processes into multiple ready queues based on their need for the processor.
- Give preference to processes with short CPU bursts.
- Give preference to processes with high I/O bursts. (I/O bound processes will sleep in the wait queue to give other processes CPU time.)
The multilevel feedback queue was first developed by Fernando J. Corbató (1962).[2] For this accomplishment, the Association for Computing Machinery awarded Corbató the Turing Award.[3]