Limitations of using tokens for mutual exclusion

Authors:
Edward T. Ordman
Affiliations:
Department of Mathematical Sciences, The University of Memphis, Memphis, TN
Venue:
CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science
Year:
1995

Citing 4
Cited 0

The drinking philosophers problem

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Concurrent programming: principles and practice

Concurrent programming: principles and practice
Distributed algorithm for K-entries to critical section based on the directed graphs

ACM SIGOPS Operating Systems Review
Solution of a problem in concurrent programming control

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract