Priority ceiling protocol ========================= 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. The protocol works by temporarily raising the priorities of tasks in certain situations, thus it requires a scheduler that supports dynamic priority scheduling. 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. The protocol works by temporarily raising the priorities of tasks in certain situations, thus it requires a scheduler that supports dynamic priority scheduling. ==See also== Priority inheritance REFERENCES ---------- BIBLIOGRAPHY (BibTeX) -------------------- @article{ref0, title = {Priority ceiling protocol}, url = {https://encyclopegia.org/a/priority-ceiling-protocol} } BIBLIOGRAPHY (RIS) ------------------- TY - JOUR TI - Priority ceiling protocol UR - https://encyclopegia.org/a/priority-ceiling-protocol ER - CITE THIS ARTICLE ---------------- Cite this article: Priority ceiling protocol Derived from: https://en.wikipedia.org/w/index.php?oldid=1335833036 Licence: CC BY-SA 4.0 Snapshot: enwiki-001335833036 Permalink: /a/priority-ceiling-protocol