Semaphores in Ada-94

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Semaphores in Ada-94

Full text

Pdf (390 KB)

Source

ACM SIGAda Ada Letters archive
Volume XIV , Issue 5 (Sept./Oct. 1994) table of contents

Pages: 71 - 79

Year of Publication: 1994

ISSN:1094-3641

Author

Kwok-bun Yue

Division of Computing and Mathematics, University of Houston -Clear Lake, 2700 Bay Area Boulevard, Houston, TX

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 13, Citation Count: 3

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	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/192867.192870 What is a DOI?

ABSTRACT

The new protected type and requeue features in Ada-94 make possible the efficient implementations of many concurrent solutions, previously not possible in Ada-83. In this paper, the implementations of various semaphore systems in Ada-94 are presented. These systems are more general and powerful than the familiar binary and counting semaphores. As examples, the uses of the most general one, PV_general, in resource management and the synchronization of general mutual exclusion problems are discussed.

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-9x] Ada 9X Reference Manual, Version 4.0 (1993).
	2	John Barnes, Programming in Ada95, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1995
	3	Alan Burns, Concurrent programming in Ada, Cambridge University Press, New York, NY, 1985
	4	[Henderson 77] P. Henderson & Y.A. Zalcstein, A graph theoretic characterization of the PVchunk class of synchronizing primitives. SIAM J. Computing. 6 (1), 88-108 (1977).
	5	Peter B. Henderson , Yechezkel Zalcstein, Synchronization Problems Solvable by Generalized PV Systems, Journal of the ACM (JACM), v.27 n.1, p.60-71, Jan. 1980 [doi>10.1145/322169.322175]
	6	Eugene W. Stark, Semaphore primitives and starvation-free mutual exclusion, Journal of the ACM (JACM), v.29 n.4, p.1049-1072, Oct. 1982 [doi>10.1145/322344.322352]
	7	K. Yue , R. T. Jacob, An efficient starvation-free semaphore solution for the graphical mutual exclusion problem, The Computer Journal, v.34 n.4, p.345-349, Aug. 1991 [doi>10.1093/comjnl/34.4.345]
	8	Kwok-bun Yue, An Ada solution to the general mutual exclusion problem, ACM SIGAda Ada Letters, v.XIII n.4, p.37-43, July/Aug. 1993 [doi>10.1145/163105.163108]

CITED BY 3

	Kwok-bun Yue , Sadegh Davari , Ted Leibfried, Priority ceiling protocol in Ada, Proceedings of the conference on TRI-Ada '96: disciplined software development with Ada, p.3-9, December 03-07, 1996, Philadelphia, Pennsylvania, United States
	Gertrude Levine, Ada and the control of intrusion, ACM SIGAda Ada Letters, v.XXV n.3, p.32-39, September 2005
	Pascal Ledru, Translation of the protected type mechanism in Ada 83, ACM SIGAda Ada Letters, v.XV n.1, p.64-69, Jan./Feb. 1995