(Enter summary)
Abstract: A new solution to the mutual exclusion problem is presented that, in the
absence of contention, requires only seven memory accesses. It assumes
atomic reads and atomic writes to shared registers.
Capsule Review
To build a useful computing system from a collection of processors that communicate
by sharing memory, but lack any atomic operation more complex
than a memory read or write, it is necessary to implement mutual exclusion
using only these operations. Solutions to this problem have been... (Update)
Cited by: More
A Study of Objects - Hankin (1999)
(Correct)
Disk Paxos - Gafni, Lamport (2002)
(Correct)
Bounded Model Checking for Timed Systems - Audemard, Cimatti, Kornilowicz.. (2002)
(Correct)
Similar documents (at the sentence level):
69.0%: A Fast Mutual Exclusion Algorithm - Lamport (1986)
(Correct)
Active bibliography (related documents): More All
0.2: Mutual Exclusion Using Invisible Reads and Writes - Burns, al. (1980)
(Correct)
0.2: A First Come First Served Mutual Exclusion Algorithm With Small.. - Lycklama (1991)
(Correct)
0.2: The Mutual Exclusion Problem - Part II: Statement and Solutions - Lamport (2000)
(Correct)
Similar documents based on text: More All
0.1: A Theorem on Atomicity in Distributed Algorithms - Lamport (1988)
(Correct)
0.1: Pretending Atomicity - Lamport, Schneider (1989)
(Correct)
0.1: Processes are in the Eye of the Beholder - Lamport (1994)
(Correct)
Related documents from co-citation: More All
25: Solution of a problem in concurrent programming control (context) - Dijkstra - 1965
22: The Performance of Spin Lock Alternatives for Shared-memory Multiprocessors (context) - Anderson - 1990
22: Algorithms for scalable synchronization on shared-memory multiprocessors (context) - Mellor-Crummey, Scott - 1991
BibTeX entry: (Update)
L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1):1--11, 1987. http://citeseer.ist.psu.edu/lamport86fast.html More
@article{ lamport87fast,
author = "Leslie Lamport",
title = "A Fast Mutual Exclusion Algorithm",
journal = "ACM Transactions on Computer Systems",
volume = "5",
number = "1",
pages = "1--11",
year = "1987",
url = "citeseer.ist.psu.edu/lamport86fast.html" }
Citations (may not include all citations):
223
Assigning meanings to programs (context) - Floyd - 1967
157
Proving the correctness of multiprocess programs (context) - Lamport - 1977 DBLP
142
Solution of a problem in concurrent programming control (context) - Dijkstra - 1965
104
Proving liveness properties of concurrent programs (context) - Owicki, Lamport - 1982 ACM DBLP
19
An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
18
Experience using multiprocessor systems---A status report (context) - Jones, Schwarz - 1980
13
Further comments on Dijkstra's concurrent programming contro.. (context) - Eisenberg, McGuire - 1972 ACM DBLP
5
Additional comments on a problem in concurrent programming c.. (context) - deBruijn - 1967 ACM DBLP
4
Additional commments on a problem in concurrent program cont.. (context) - Knuth - 1966
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.digital.com/SRC/personal/lamport/pubs/pubs.html): More
The Temporal Logic of Actions - Lamport (1993)
(Correct)
Byzantine Generals and Transaction Commit Protocols - Lamport, Fischer (1982)
(Correct)
Mechanical Verification of Concurrent Systems with TLA - Engberg, Grønning, Lamport (1992)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC