COMPUTER SOFTWARE
OPERATING SYSTEMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Handles processes in the order in which they arrive
|
|
|
Handles each process in turn
|
|
|
Handles different queues using priorities to promote and demote processes
|
|
|
Handles the processes requiring the least amount of time to complete first
|
Detailed explanation-1: -Scheduling algorithms are designed to have some process running at all times to keep the central processing unit (CPU) busy. 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.
Detailed explanation-2: -It enables a process to switch between queues. If a process consumes too much processor time, it will be switched to the lowest priority queue. A process waiting in a lower priority queue for too long may be shifted to a higher priority queue. This type of aging prevents starvation.
Detailed explanation-3: -Multilevel queue scheduling can be either preemptive or non-preemptive in nature, depending on the scheduling algorithm used in each queue. For example, a Round Robin algorithm is preemptive, whereas First Come, First Serve is non-preemptive.