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.
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.
Source: Wikipedia "Priority inversion" · CC BY-SA 4.0
Share this article: X · Bluesky