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 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 preempted by a medium priority task.
Priority inversion - Wikipedia Jump to content From Wikipedia, the free encyclopedia Undesireable computing scheduling scenario 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. Formulation [ edit ]
related reading
- How To Do Lessalexturek.com
- Strict Priority Scheduler | CS 162 Project 2cs162.org
- False sharing - Wikipediaen.wikipedia.org
- Principal–agent problem - Wikipediaen.wikipedia.org
- JavaScript Loading Priorities in Chromeaddyosmani.com
- Embarrassingly parallel - Wikipediaen.wikipedia.org
- Non-blocking algorithm - Wikipediaen.wikipedia.org
- Multithreading (computer architecture) - Wikipediaen.wikipedia.org
- Microtasks and event looptr.javascript.info
- Context switch - Wikipediaen.wikipedia.org
- Processes in Linux - Everything You Need to Knowreliabilityengineering.substack.com
- Slice Dat Time | Putting the "You" in CPUcpu.land