Semaphore primitives and starvation-free mutual exclusion

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Semaphore primitives and starvation-free mutual exclusion

Full text

Pdf (1.40 MB)

Source

Journal of the ACM (JACM) archive
Volume 29 , Issue 4 (October 1982) table of contents

Pages: 1049 - 1072

Year of Publication: 1982

ISSN:0004-5411

Author

Eugene W. Stark

Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 17, Downloads (12 Months): 69, Citation Count: 8

Additional Information:

references cited by 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/322344.322352 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	BEN-ARi, M.Temporal logic proofs of concurrent programs. Tech. Rep. 80-44, Tel-Aviv Univ., Tcl-Avtv, Israel, Nov 1980.
	2	James E. Burns , Paul Jackson , Nancy A. Lynch , Michael J. Fischer , Gary L. Peterson, Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable, Journal of the ACM (JACM), v.29 n.1, p.183-205, Jan. 1982 [doi>10.1145/322290.322302]
	3	Edward G. Coffman, Jr. , Peter J. Denning, Operating Systems Theory, Prentice Hall Professional Technical Reference, 1973
	4	P. J. Courtois , F. Heymans , D. L. Parnas, Concurrent control with “readers” and “writers”, Communications of the ACM, v.14 n.10, p.667-668, Oct. 1971 [doi>10.1145/362759.362813]
	5	COURTOtS, P.J., HEYMANS, F., AND PAgNAS, D Comments on "A Comparison of Two Synchronizing Concepts by P. B. Hansen." Acta Inf. 1 (1972), 375-376.
	6	DIJKSTRA, E.W. Cooperating sequential processes. In Programming Languages, F. Genuys, Ed, Academic Press, New York, 1968, pp, 43-112
	7	DIJKSTRA, E.W Hterarchical ordering of sequential processes. Acta Inf. 1 (1972), 115-138.
	8	Thomas W. Doeppner, Jr., On abstractions of parallel programs, Proceedings of the eighth annual ACM symposium on Theory of computing, p.65-72, May 03-05, 1976, Hershey, Pennsylvania, United States [doi>10.1145/800113.803633]
	9	A. Nico Habermann, Synchronization of communicating processes, Communications of the ACM, v.15 n.3, p.171-176, March 1972 [doi>10.1145/361268.361277]
	10	HXBI~RMANN, A.N. Review of article by Leon Presser on multiprogramming coordination. Comput. Rev. 29, 788 (Apr. 1976), 150-151
	11	Robert M. Keller, Formal verification of parallel programs, Communications of the ACM, v.19 n.7, p.371-384, July 1976 [doi>10.1145/360248.360251]
	12	Donald E. Knuth, Additional comments on a problem in concurrent programming control, Communications of the ACM, v.9 n.5, p.321-322, May 1966 [doi>10.1145/355592.365595]
	13	KOSARAJU, S.R.Limitations of Dtjkstra's semaphore primmves and Petri nets, Rep. No, 25, Computer Sctenee Dep., Jolms Hopkins Univ., Balttmore, Md., 1973.
	14	Yat-Sang Kwong, On the Absence of Livelocks in Parallel Programs, Proceedings of the International Sympoisum on Semantics of Concurrent Computation, p.172-190, July 02-04, 1979
	15	Richard J. Lipton, On synchronization primitive systems, 1973
	16	Richard J. Lipton, Reduction: a method of proving properties of parallel programs, Communications of the ACM, v.18 n.12, p.717-721, Dec. 1975 [doi>10.1145/361227.361234]
	17	MILLER, R.E., AND YAP, C K. Formal specification and analysis of loosely eormc~od processes. IBM Res. Rep. RC 6716, IBM Thomas J. Watson Research Lab., Yorktown Heights, N.Y., 1977.
	18	MORgI$, J.M. A starvation-free solution to the mutuabexclusion problem. Inf. Proc. Left. 8, 2 (Feb. 1979), 76-80.
	19	Leon Presser, Multiprogramming Coordination, ACM Computing Surveys (CSUR), v.7 n.1, p.21-44, March 1975 [doi>10.1145/356643.356646]
	20	Alan C. Shaw, The Logical Design of Operating Systems, Prentice Hall PTR, Upper Saddle River, NJ, 1974
	21	STARK~ E.W.Semaphore primitives and starvation-fr~ mutual exclusion. Tech. Rep. TM-158, Lab. for Computer Sci~ac~, M I.T., Cambridge, Mass., 1980.

CITED BY 8

	Ralph E. Johnson , Fred B. Schneider, Symmetry and similarity in distributed systems, Proceedings of the fourth annual ACM symposium on Principles of distributed computing, p.13-22, August 1985, Minaki, Ontario, Canada
	E. Styer , G. L. Peterson, Tight bounds for shared memory symmetric mutual exclusion problems, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.177-191, June 1989, Edmonton, Alberta, Canada
	Christos H. Papadimitriou, A theorem in database concurrency control, Journal of the ACM (JACM), v.29 n.4, p.998-1006, Oct. 1982
	Dieter Zöbel, The Deadlock problem: a classifying bibliography, ACM SIGOPS Operating Systems Review, v.17 n.4, p.6-15, October 1983
	Kenneth A. Reek, The well-tempered semaphore: theme with variations, ACM SIGCSE Bulletin, v.34 n.1, March 2002
	Kwok-bun Yue, Semaphores in Ada-94, ACM SIGAda Ada Letters, v.XIV n.5, p.71-79, Sept./Oct. 1994
	Pierre Castori, Semaphores revisited with MMS, ACM SIGOPS Operating Systems Review, v.29 n.3, p.49-63, July 1995
	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