Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers

Volumn 39, Issue 9, 1990, Pages 1175-1185

  Sha, Lui ^a   Rajkumar, Ragunathan ^b   Lehoczky, John P ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Priority inheritance; priority inversion; realtime systems; scheduling; synchronization

Indexed keywords

COMPUTER OPERATING SYSTEMS - DESIGN;

PROTOCOLS; REAL TIME SYSTEMS; SYNCHRONIZATION;

COMPUTER SYSTEMS, DIGITAL;

EID: 0025488794     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.57058     Document Type: Article

References (15)

1. J. B. Goodenough and L. Sha, “The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks,” in Proc. 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,” in Proc. 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,” in Proc. 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, 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,” in Proc. IEEE Real-Time Syst. Symp., 1986.
12. L. Sha, R. Rajkumar, and J. P. Lehoczky, “Task scheduling in distributed real-time systems,” in Proc. IEEE Industrial Electron. Conf., 1987.
13. ——, “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. ——, “Preemptive scheduling under time and resource constraints,” IEEE Trans. Comput., Aug. 1987.