language-icon Old Web
English
Sign In

Priority inversion

In computer science, priority inversion is a scenario in scheduling in which a high priority task is indirectly preempted by a lower priority task effectively inverting the relative priorities of the two tasks. In computer science, priority inversion is a scenario in scheduling in which a high priority task is indirectly preempted by a lower priority task effectively inverting the relative priorities of the two tasks.

[ "Two-level scheduling", "Rate-monotonic scheduling", "Round-robin scheduling" ]
Parent Topic
Child Topic
    No Parent Topic