When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called

Related MCQs

• If the resources are always preempted from the same process                      can occur.
• An SJF algorithm is simply a priority algorithm where the priority is                          
• Instead of starting a new thread for every task to execute concurrently, the task can be passed to a                        
• In priority scheduling algorithm
• What is a medium-term scheduler?
• What is the high speed memory between the main memory and the CPU called?
• The link between two processes P and Q to send and receive messages is called
• The                    time in a swap out of a running process and swap in of a new process into the memory is very high.
• If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order            bits of a logical address designate the page number, and the          low order bits designate the page offset.
• What are the two steps of a process execution?