Priority inversion

Known as: Inversion 
In computer science, priority inversion is a problematic scenario in scheduling in which a high priority task is indirectly preempted by a lower… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Priority inversion occurs when the execution of a task is unnecessarily delayed by the dispatch of a lower priority task. This… (More)
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper focuses on resource sharing in hierarchical fixed priority pre-emptive systems where a number of separate applications… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
There is increasing demand to extend Object RequestBroker (ORB) middleware to support distributed applications withstringent real… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
A priority inversion occurs when a low-priority task causes the execution of a higher-priority task to be delayed. The… (More)
  • figure 1
  • figure 2
Is this relevant?
1993
1993
Synchronization and communication are two common sources of priority inversion which may make the behavior of systems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Due to resource sharing among tasks, priority inversion can occur during prioritydriven preemptive scheduling. In this work, we… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
AbstmctA direct application of commonly used synchronization primitives such as semaphores, monitors, or the Ada rendezvous can… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
At the First International Workshop on Real-Time Ada Issues, it was reported that a high-priority Ada task can be delayed… (More)
  • figure 1
  • figure 1
  • figure 2
Is this relevant?
1988
1988
To successfully engineer a large scale real-time system project, we need a disciplined approach to both the logical complexity… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1987
1987
It should be possible to program the following two assertions about the interactions between a set of client task s and a server… (More)
Is this relevant?