In real-time computing, priority inheritance is a method for eliminating unbounded priority inversion. Using this programming method, a process scheduling algorithm increases the priority of a process (A) to the maximum priority of any other process waiting for any resource on which A has a resource lock (if it is higher than the original priority of A).
The basic idea of the priority inheritance protocol is that when a job blocks one or more high-priority jobs, it ignores its original priority assignment and executes its critical section at an elevated priority level. After executing its critical section and releasing its locks, the process returns to its original priority level.
YouTube Encyclopedic
-
1/3Views:4 86249 486706
-
L19 07 Priority Inheritance
-
Introduction to RTOS Part 11 - Priority Inversion | Digi-Key Electronics
-
Priority Inversion_Part3
Transcription
Example
Consider three jobs:
| Job Name | Priority |
|---|---|
| H | High |
| M | Medium |
| L | Low |
Suppose that both H and L require some shared resource. If L acquires this shared resource (entering a critical section), and H subsequently requires it, H will block until L releases it (leaving its critical section). Without priority inheritance, process M could preempt process L during the critical section and delay its completion, in effect causing the lower-priority process M to indirectly preempt the high-priority process H. This is a priority inversion bug.
With priority inheritance, L will execute its critical section at H's high priority whenever H is blocked on the shared resource. As a result, M will be unable to preempt L and will be blocked. That is, the higher-priority job M must wait for the critical section of the lower priority job L to be executed, because L has inherited H's priority. When L exits its critical section, it regains its original (low) priority and awakens H (which was blocked by L). H, having high priority, preempts L and runs to completion. This enables M and L to resume in succession and run to completion without priority inversion.
Operating systems supporting priority inheritance
- ERIKA Enterprise[1][circular reference]
- FreeRTOS
- Microsoft Azure RTOS, formerly Express Logic's ThreadX
- Linux[2]
- VxWorks
- iRMX[3]
See also
References
- Lui Sha; Ragunathan Rajkumar & John P. Lehoczky (September 1990). "Priority Inheritance Protocols: An Approach to Real-Time Synchronization" (PDF). IEEE Transactions on Computers. 39 (9): 1175–1185. doi:10.1109/12.57058. Archived from the original (PDF) on 2022-04-19.
- ^ "ERIKA Enterprise". Retrieved 2024-01-03.
- ^ "RT-mutex subsystem with PI support". Retrieved 2021-11-27.
- ^ "Resource-centric real-time kernel and middleware services" (PDF). p. 3. Retrieved 2024-01-01.
External links
- "Priority Inheritance: The Real Story" by Doug Locke
- "Against Priority Inheritance" by Victor Yodaiken
- "Implementing Concurrency Control With Priority Inheritance in Real-Time CORBA" by Steven Wohlever, Victor Fay Wolfe and Russell Johnston
- "Priority Inheritance Spin Locks for Multiprocessor Real-Time Systems" by Cai-Dong Wang, Hiroaki Takada and Ken Sakamura
- "Hardware Support for Priority Inheritance" by Bilge E. S. Akgul, Vincent J. Mooney, Henrik Thane and Pramote Kuacharoen
 | This computer science article is a stub. You can help Wikipedia by expanding it. |
This page was last edited on 23 May 2024, at 00:05