Bounds on shared memory for mutual exclusion

Information and Computation

Volumn 107, Issue 2, 1993, Pages 171-184

  Burns, James E ^a   Lynch, Nancy A ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249000189     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1993.1065     Document Type: Article

References (17)

1. Burns, J. E. (1978). Mutual exclusion with linear waiting using binary shared variables, SIGACT NEWS 10. 42-17.
2. Burns, J. E. (1981a), Symmetry in systems of asynchronous processes, in "Proceedings, 22nd IEEE Symposium on Foundations of Computer Science," pp. 169-174.
3. Burns, J. E. (1981b), "Complexity of Communication among Asynchronous Parallel Processes," Ph.D. thesis, Georgia Institute of Technology.
4. Burns, J. E., Lynch, N. A., Jackson, P., Fischer, M. J., and Peterson, G. L. (1982), Data requirements for implementation of;V-process mutual exclusion using a single shared variable, J. Assoc. Comput. Mach. 29, 183-205.
5. de Bruijn, N. G. (1967), Additional comments on a problem in concurrent programming control. Comm. ACM 10, 137.
6. Cremers, A., and Hibbard, T. N. (1979), Mutual exclusion of N processors using an O(A')- valued message variable (extended abstract), in "Lecture Notes in Computer Science," Vol. 62, pp. 165-176, Springer-Verlag, Berlin/New York.
7. Dijkstra, E. W. (1965), Solution of a problem in concurrent programming control. Comm. ACM 8. 569.
8. Eisenberg, M. A., and R. McGuire, M. (1972), Further comments on Dijkstra's concurrent programming control problem. Comm. ACM 15, 137.
9. Johnson, R. E., and Schneider, F. B. (1985). Symmetry and similarity in distributed systems, in "Proceedings, Fourth Annual ACM Symposium on Principles of Distributed Computing," pp. 13-22.
10. Knuth, D. E. (1966), Additional comments on a problem in concurrent control. Comm. ACM 9. 321-322.
11. Lamport, L. (1974), A new solution of Dijkstra's concurrent programming problem. Comm. ACM 17, 453-455.
12. Lamport, L. (1986a), On interprocess communication. I. Basic formalism, Disirib. Comput. 1, 77-85.
13. Lamport, L. (1986b), The mutual exclusion problem. I. A theory of interprocess communication, J. Assoc. Comput. Much. 33, 313-326.
14. Lamport, L. (1986c), The mutual exclusion problem. II. Statement and solutions. J. Assoc. Comput. Mach. 33, 327-348.
15. Peterson, G. L. (1979), "The Complexity of Parallel Algorithms," Ph.D. Thesis, Univ. of Washington.
16. Peterson, G. L. (1983), A new solution to Lamport's concurrent programming problem using small shared variables, ACM Trans. Programming Languages Systems 5, 56-65.
17. Styer, E. F., and Peterson, G. L. (1989), "Tight Bounds for Shared Memory Symmetric Mutual Exclusion Problems. Technical Report GIT-ICS-89/09, School of Information and Computer Science, Georgia Institute of Technology. (To appear in "Proceedings, Eight Annual ACM Symposium on Principles of Distributed Computing, August, 1989.")