Sources
Help build the largest human-edited directory on the web.
Submit a site - Become an editor
Wikipedia. Licensed under the GNU Free Documentation License.
Are you an expert in this subject? Join the discussion and share your knowledge at Wikipedia.org.
Priority ceiling protocol
From Wikipedia, the free encyclopedia
In real-time computing, the priority ceiling protocol is a synchronization protocol for shared resources to avoid unbounded priority inversion and mutual deadlock due to wrong nesting of critical sections. In this protocol each resource is assigned a priority ceiling, which is a priority equal to the highest priority of any task which may lock the resource.[1]
In the Immediate Ceiling Priority Protocol (ICPP) when a task locks the resource its priority is temporarily raised to the priority ceiling of the resource, thus no task that may lock the resource is able to get scheduled. This allows a low priority task to defer execution of higher-priority tasks.
The Original Ceiling Priority Protocol (OCPP) has the same worst-case performance but is subtly different in the implementation which can provide finer grained priority inheritance control mechanism than ICCP.
A task will not get scheduled if any resource it may lock actually has been locked by another task, and therefore the priority ceiling protocol prevents deadlocks.
ICPP is called "Priority Protect Protocol" in POSIX and "Priority Ceiling Emulation" in RTSJ. [2]
- ^ Lui Sha, Ragunathan Rajkumar, and John P. Lehoczky (September 1990). "Priority Inheritance Protocols: An Approach to Real-Time Synchronization". IEEE Transactions on Computers 39 (9): 1175–1185. ISSN 0018-9340.
- ^ Alan Burns, and Andy Wellings (March 2001). Real-Time Systems and Programming Languages — Ada 95, Real-Time Java and Real-Time POSIX, 3rd, Addison Wesley Longmain. ISBN 0201729881.
- How to use priority inheritance, by Kyle Renwick and Bill Renwick (2004-05-18)