Priority ceiling protocol in Ada

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Priority ceiling protocol in Ada

Full text

Pdf (623 KB)

Source

Annual International Conference on Ada archive
Proceedings of the conference on TRI-Ada '96: disciplined software development with Ada table of contents

Philadelphia, Pennsylvania, United States

Pages: 3 - 9

Year of Publication: 1996

ISBN:0-89791-808-8

Authors

Kwok-bun Yue	University of Houston - Clear Lake, Houston, TX
Sadegh Davari	University of Houston - Clear Lake, Houston, TX
Ted Leibfried	University of Houston - Clear Lake, Houston, TX

Sponsor

SIGADA: ACM Special Interest Group on Ada Programming Language

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 17, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/240678.240679 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Ada 95 Mapping~evision Team,/Ida 95 Reference Manual, Intermetics, Inc., 1995.
	2	Alan Burns, Concurrent programming in Ada, Cambridge University Press, New York, NY, 1985
	3	A. Burns , A. J. Wellings, Implementing analysable hard real-time sporadic tasks in Ada 9X, ACM SIGAda Ada Letters, v.XIV n.1, p.38-49, Jan./Feb. 1994 [doi>10.1145/181492.181495]
	4	Sadegh Davari , Lui Sha, Sources of unbounded priority inversions in real-time systems and a comparative study of possible solutions, ACM SIGOPS Operating Systems Review, v.26 n.2, p.110-120, April 1992 [doi>10.1145/142111.142126]
	5	J. B. Goodenough , L. Sha, The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks, ACM SIGAda Ada Letters, v.VIII n.7, p.20-31, June 1-3, 1988
	6	Lehocz~, J. et. al., Fixed priority scheduling theory for hard realtime systems, in Foundations of real-time computing scheduling and resource management, ed. by van Tilborg, A. & Koob, O., Kluwer Academic Publishers, 1991.
	7	C. L. Liu , James W. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM (JACM), v.20 n.1, p.46-61, Jan. 1973 [doi>10.1145/321738.321743]
	8	Ragunathan Rajkumar , Lui Sha , John P. Lehoczky , Krithi Ramamritham, An optimal priority inheritance policy for synchronization in real-time systems, Advances in real-time systems, Prentice-Hall, Inc., Upper Saddle River, NJ, 1995
	9	Lui Sha , John B. Goodenough, Real-Time Scheduling Theory and Ada, Computer, v.23 n.4, p.53-62, April 1990 [doi>10.1109/2.55469]
	10	L. Sha , R. Rajkumar , J. P. Lehoczky, Priority Inheritance Protocols: An Approach to Real-Time Synchronization, IEEE Transactions on Computers, v.39 n.9, p.1175-1185, September 1990 [doi>10.1109/12.57058]
	11	Kwok-bun Yue, Semaphores in Ada-94, ACM SIGAda Ada Letters, v.XIV n.5, p.71-79, Sept./Oct. 1994 [doi>10.1145/192867.192870]