Editing Priority ceiling protocol (section)

In [[real-time computing]], the '''priority ceiling protocol''' is a synchronization protocol for [[resource (computer science)|shared resource]]s to avoid unbounded [[priority inversion]] and mutual [[Deadlock (computer science)|deadlock]] due to wrong nesting of [[critical section]]s. In this protocol each resource is assigned a priority ceiling, which is a [[:wikt:priority|priority]] equal to the highest priority of any [[task (computers)|task]] which may lock the resource. The protocol works by temporarily raising the priorities of tasks in certain situations, thus it requires a [[Scheduling (computing)|scheduler]] that supports [[dynamic priority scheduling]].<ref>
{{cite web
 | last = Renwick
 | first = Kyle
 | authorlink =
 | last2 = Renwick
 | first2 = Bill
 | title = How to use priority inheritance
 | publisher = embedded.com
 | date = May 18, 2004
 | url = http://www.embedded.com/design/configurable-systems/4024970/How-to-use-priority-inheritance
 | accessdate = November 11, 2014}}</ref>