The mutual exclusion problem has been solved

Authors:
Leslie Lamport
Affiliations:
Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, California
Venue:
Communications of the ACM
Year:
1991

Citing 7
Cited 0

The mutual exclusion problem: part I—a theory of interprocess communication

Journal of the ACM (JACM)
Algorithms for mutual exclusion

Algorithms for mutual exclusion
An operating systems vade mecum; (2nd ed.)

An operating systems vade mecum; (2nd ed.)
Principles of concurrent and distributed programming

Principles of concurrent and distributed programming
Self-assessment procedure XXI: a self-assessment procedure on concurrency

Communications of the ACM
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Operating system principles

Operating system principles

Quantified Score

Hi-index	48.22

Visualization

Abstract

“A common assumption underlying mutual exclusion algorithms in shared memory systems is that: b. A memory reference to an individual word is mutually exclusive.”