Skip to search formSkip to main contentSkip to account menu

Priority ceiling protocol

Known as: PCP, Priority ceiling 
In real-time computing, the priority ceiling protocol is a synchronization protocol for shared resources to avoid unbounded priority inversion and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
AdaCritical sectionDeadlockDynamic priority scheduling

Broader (2)

Concurrency controlReal-time computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Multiprocessor Priority Ceiling Protocol
There are implementations of a variety of priority inversion control algorithms in the uniprocessor systems, but there has been… 
2007
2007
Feasibility conditions with kernel overheads for mixed preemptive FP/FIFO Scheduling with priority ceiling protocol on an event driven OSEK system
In this paper, we propose to extend real-time feasibility conditions taking into account kernel overheads for mixed preemptive… 
2005
2005
An Improved Priority Ceiling Protocol to Reduce Context Switches in Task Synchronization
Context switching between concurrent tasks is a pure operating system overhead which wastes CPU cycles. This paper describes a… 
1999
1999
The Priority Ceiling Protocol : Formalization and Analysis Using PVS
Common real-time operating systems rely on priority-based, preemptive scheduling. Resource sharing in such systems potentially… 
1999
1999
RapidSched: static scheduling and analysis for real-time CORBA
The paper presents a real time CORBA Scheduling Service called RapidSched. RapidSched uses a global, distributed deadline… 
1996
1996
EXTENDING THE PRIORITY CEILING PROTOCOL USING READ/WRITE AFFECTED SETS
Concurrency control algorithms that are used in a real-time database must satisfy the timing requirements of the transactions as… 
Review
1994
Review
1994
Chapter 8 Scheduling Periodic and Aperiodic Tasks Using the Slack Stealing Algorithm 8.1 Introduction
This chapter discusses the problem of jointly scheduling hard deadline periodic tasks and both hard and soft deadline aperiodic… 
1993
1993
Worst-case timing analysis of exception handling in Ada
This paper describes a method for analysing the timing properties of exception handling in Ada. The paper first describes how… 
1991
1991
Guaranteeing Hard Real Time End-to-End Communications Deadlines
In a distributed hard real time system communication between tasks on different processor must occur in bounded time. The… 
1989
1989
Dynamic priority ceilings
Real-time systems have stringent deadline requirements for their tasks. To meet the requirements, a real-time system must utilize… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)