Lamport on mutual exclusion: 27 years of planting seeds

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2001, Pages 3-12

  Anderson, J H ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FAULT TOLERANT COMPUTER SYSTEMS; SEMANTICS; SYNCHRONIZATION;

LESLIE LAMPORT; MUTUAL EXCLUSION; SHARED MEMORY SYSTEM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0034772073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (54)

1. Long-lived renaming made adaptive
2. Fast, wait-free (2k - 1)-renaming
3. Adaptive mutual exclusion with local spinning
4. An improved lower bound for the time complexity of mutual exclusion
5. Time/contention tradeoffs for multiprocessor synchronization
6. Adaptive and efficient mutual exclusion
7. Adaptive wait-free algorithms for lattice agreement and renaming
8. Adaptive long-lived renaming with read and write operations
9. Constructing two-writer atomic registers
10. Long-lived renaming made fast
11. Constructing multi-reader atomic values from non-atomic values
12. Pure buffers for concurrent reading while writing
13. Adaptive solutions to the mutual exclusion problem
14. The communication requirements of mutual exclusion
15. Solution of a problem in concurrent programming control
16. Self-stabilizing systems in spite of distributed control, EWD 391
17. Linearizability: A correctness condition for concurrent objects
18. Atomic multireader register
19. Additional comments on a problem in concurrent programming control
20. The non-blocking write protocol nbw: A solution to a real-time synchronization problem
21. My writings
22. A new solution of Dijkstra's concurrent programming problem
23. Concurrent reading and writing
24. Proving the correctness of multiprocess programs
25. Time, clocks, and the ordering of events in a distributed system
26. How to make a multiprocessor computer that correctly executes multiprocess programs
27. A new approach to proving the correctness of multiprocess programs
28. Reasoning about nonatomic operations
29. Buridan's principle
30. What it means for a concurrent program to satisfy a specification: Why no one has specified priority
31. The mutual exclusion problem: Part I - A theory of interprocess communication
32. The mutual exclusion problem: Part II - Statement and solutions
33. On interprocess communication: Part I - Basic formalism
34. On interprocess communication: Part II - Algorithms
35. A fast mutual exclusion algorithm
36. Concurrent reading and writing of clocks
37. Win and sin: Predicate transformers for concurrency
38. Introduction to TLA
39. On the glitch phenomenon
40. When does a correct mutual exclusion algorithm guarantee mutual exclusion?
41. Fast, long-lived renaming
42. Wait-free algorithms for fast, long-lived renaming
43. A protocol for wait-free, atomic, multi-reader shared variables
44. An axiomatic proof technique for parallel programs
45. Concurrent reading while writing
46. Implementing fault-tolerant services using the state-machine approach
47. The elusive atomic register
48. A real-time system design methodology
49. Improving fast mutual exclusion
50. How to construct an atomic variable
51. Atomic shared register access by asynchronous hardware
52. Fast, scalable synchronization with minimal hardware support