Limitations of using tokens for mutual exclusion

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Limitations of using tokens for mutual exclusion

Full text

Pdf (466 KB)

Source

ACM Annual Computer Science Conference archive
Proceedings of the 1995 ACM 23rd annual conference on Computer science table of contents

Nashville, Tennessee, United States

Pages: 26 - 29

Year of Publication: 1995

ISBN:0-89791-737-5

Author

Edward T. Ordman

Department of Mathematical Sciences, The University of Memphis, Memphis, TN

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 7, 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/259526.259533 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	Gregory R. Andrews, Concurrent programming: principles and practice, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1991
	2	K. M. Chandy , J. Misra, The drinking philosophers problem, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.4, p.632-646, Oct. 1984 [doi>10.1145/1780.1804]
	3	V. ChvAtal and P. Hammer, Aggregation of inequalities in integer programming, Ann. Discrete Math. 1 (1977), 145-162.
	4	M. B. Cozzens and R. Liebowitz, Threshold dimension of graphs, SIAM J. Algebraic Discrete Methods 5(1984), 579-595.
	5	E. W. Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM, v.8 n.9, p.569, Sept. 1965 [doi>10.1145/365559.365617]
	6	P. Henderson and Y. Zalcstein, A graph theoretic characterization of the PVchunk class of synchronizing primitives, SIAM J. Comp. 6 (1977), 88-108,
	7	Mohamed Naimi, Distributed algorithm for K-entries to critical section based on the directed graphs, ACM SIGOPS Operating Systems Review, v.27 n.4, p.67-75, Oct. 1993 [doi>10.1145/163640.163646]
	8	E. T. Ordman, Threshold coverings and resource allocation, Proc. 16th Southeastern International Conf. on Graph Theory, Combinatorics, and Computing, Congr. Numer. 49(1985), 99-113.
	9	E. T. Ordman, Cliques in hypergraphs and mutual ezclusion using tokens, submitted to J. Combinatorial Math. and Combinatorial Comp.
	10	J. Orlin, Contentment in Graph Theory: covering graphs with cliques, lndag. Math. 39 (1977), 406-424.