Editing Priority inversion (section)

{{Short description|Undesireable computing scheduling scenario}}

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