Dynamic priority ceilings
M.I. Chen, Ke Lin · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1989
Real-time systems have stringent deadline requirements for their tasks. To meet the requirements, a real-time system must utilize scheduling algorithms which ensure a predictable response even in the face of mutually exclusive access requests to critical sections. The authors present a concurrency control protocol which defines dynamic priority ceilings for all critical sections so that tasks with priorities lower than the priority ceiling of any in-sue critical section must be blocked when trying to enter a critical section. The protocol is useful in systems using the earliest deadline first scheduling policy. The authors show that the protocol prevents both deadlock and chained blocking. The schedulability condition and implementation issues of the protocol are also discussed.