This Article 
 Bibliographic References 
 Add to: 
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
September 1990 (vol. 39 no. 9)
pp. 1175-1185

An investigation is conducted of two protocols belonging to the priority inheritance protocols class; the two are called the basic priority inheritance protocol and the priority ceiling protocol. Both protocols solve the uncontrolled priority inversion problem. The priority ceiling protocol solves this uncontrolled priority inversion problem particularly well; it reduces the worst-case task-blocking time to at most the duration of execution of a single critical section of a lower-priority task. This protocol also prevents the formation of deadlocks. Sufficient conditions under which a set of periodic tasks using this protocol may be scheduled is derived.

[1] J. B. Goodenough and L. Sha, "The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks," inProc. 2nd ACM Int. Workshop Real-Time Ada Issues, 1988.
[2] B. W. Lampson and D. D. Redell, "Experiences with processes and monitors in Mesa,"Commun. ACM, vol. 23, no. 2, pp. 105-117, Feb. 1980.
[3] J. P. Lehoczky and L. Sha, "Performance of real-time bus scheduling algorithms,"ACM Perform. Eval. Rev., Special Issue, vol. 14, no. 1, May 1986.
[4] J. P. Lehoczky, L. Sha, and J. Strosnider, "Enhancing aperiodic responsiveness in a hard real-time environment," inProc. IEEE Real-Time Syst. Symp., 1987.
[5] J. P. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithm--Exact characterization and average case behavior," inProc. IEEE Real-Time Syst. Symp., 1989.
[6] D. W. Leinbaugh, "Guaranteed response time in a hard real-time environment,"IEEE Trans. Software Eng., Jan. 1980.
[7] J. Y. Leung and M. L. Merrill, "A note on preemptive scheduling of periodic, real time tasks,"Inform. Processing Lett., vol. 11, no. 3, pp. 115-118, Nov. 1980.
[8] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[9] A. K. Mok, "Fundamental design problems of distributed systems for the hard real time environment," Ph.D. dissertation, M.I.T., 1983.
[10] K. Ramamritham and J. A. Stankovic, "Dynamic task scheduling in hard real-time distributed systems,"IEEE Software, July 1984.
[11] L. Sha, J. P. Lehoczky, and R. Rajkumar, "Solutions for some practical problems in prioritized preemptive scheduling," inProc. IEEE Real-Time Syst. Symp., 1986.
[12] L. Sha, R. Rajkumar, and J. P. Lehoczky, "Task scheduling in distributed real-time systems," inProc. IEEE Industrial Electron. Conf., 1987.
[13] L. Sha, R. Rajkumar, and J. P. Lehoczky, "Priority inheritance protocols: An approach to real-time synchronization," Tech. Rep., Dep. Comput. Sci., CMU, 1987.
[14] W. Zhao, K. Ramamritham, and J. A. Stankovic, "Scheduling tasks with resource requirements in hard real-time systems,"IEEE Trans. Software Eng., Apr. 1985.
[15] W. Zhao, K. Ramamritham, and J. A. Stankovic, "Preemptive scheduling under time and resource constraints,"IEEE Trans. Comput., Aug. 1987.

Index Terms:
real-time synchronization; priority inheritance protocols; basic priority inheritance protocol; priority ceiling protocol; uncontrolled priority inversion; worst-case task-blocking time; deadlocks; periodic tasks; operating systems (computers); protocols; real-time systems.
L. Sha, R. Rajkumar, J.P. Lehoczky, "Priority Inheritance Protocols: An Approach to Real-Time Synchronization," IEEE Transactions on Computers, vol. 39, no. 9, pp. 1175-1185, Sept. 1990, doi:10.1109/12.57058
Usage of this product signifies your acceptance of the Terms of Use.