Priority inversion

In computer science, priority inversion is a scenario in scheduling in which a high-priority task is indirectly superseded by a lower-priority task, effectively inverting the assigned priorities of the tasks. This violates the priority model that every task can only be prevented from running by a higher-priority task. Inversion occurs when there is a resource contention with a (low-priority) task that is then preempted by a higher-priority task.