Lesson plan
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.
Article summary
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.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.