COMPUTER SOFTWARE
OPERATING SYSTEMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
which of these scheduling methods separates processes into categories based on their needs for the processor
|
|
round robin
|
|
|
shortest remaining time
|
|
|
shortest job first
|
|
|
first come first served
|
|
|
multi level feedback queue
|
Explanation:
Detailed explanation-1: -Whereas the multilevel queue algorithm keeps processes permanently assigned to their initial queue assignments, the multilevel feedback queue shifts processes between queues. The shift is dependent upon the CPU bursts of prior time-slices. If a process uses too much CPU time, it will be moved to a lower-priority queue.
Detailed explanation-2: -Multilevel feedback scheduling divides the ready queue into multiple queues with different priorities. Processes move to lower priority queues if they don’t complete execution or perform I/O operations. This approach provides fair CPU time allocation and better responsiveness for interactive processes.
There is 1 question to complete.