---
title: Priority ceiling protocol
slug: priority-ceiling-protocol
qid: 
snapshot: enwiki-001335833036
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1335833036
tags: [27179519, 31836545]
---

# Priority ceiling protocol

> [!note] Provenance
> Snapshot `enwiki-001335833036` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1335833036> · Licensed CC BY-SA 4.0

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
