ACM Home Page
Please provide us with feedback. Feedback
A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
Full text PdfPdf (647 KB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 5 ,  Issue 1  (January 1983) table of contents
Pages: 56 - 65  
Year of Publication: 1983
ISSN:0164-0925
Author
Gary L. Peterson  Department of Computer Science, The University of Rochester, Rochester, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 61,   Citation Count: 14
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/357195.357199
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
2
3
4
5
6
7
 
8
LAMPORT, L. The mutual exclusion problem. SRI International, Menlo Park, Calif., Oct. 1980.
9
 
10
PETERSON, G.L. New bounds on mutual exclusion problems. Tech. Rep. TR68, Computer Science Dep., Univ. of Rochester, Rochester, N.Y., Feb. 1980.
 
11
PRTERSON, G.L. Concurrency and complexity. Tech. Rep. TR59, Computer Science Dep., Univ. of Rochester, Rochester, N.Y., Aug. 1979.
12
 
13
RIVEST, R.L., ANO PRATT, V.R. The mutual exclusion problem for unreliable processes: Preliminary report. In Proceedings, 17th Annual Symposium on Foundations of Computer Science, Houston, Tex., 1976, pp. 1-8.

CITED BY  14