Lamport on Mutual Exclusion: 27 Years of Planting Seeds (2001)

Cached

Download Links

by James H. Anderson
Venue:In 20th ACM Symposium on Principles of Distributed Computing
Citations:9 - 0 self

Documents Related by Co-Citation

117 Algorithms for Mutual Exclusion – M Raynal - 1986
6 A Unified Approach to the Study of Asynchronous Communication Mechanisms in Real Time Systems. – Ian G. Clark - 2000
10 A Criterion for Atomicity – Wim H. Hesselink, Th March - 2000
15 Elementary versus composite interfaces in distributed real-time systems – H Kopetz - 1999
62 Four-slot fully asynchronous communication mechanism – H R Simpson - 1990
9 The Formal Classification and Verification of Simpson's 4-slot Asynchronous Communication Mechanism – N. Henderson, S. E. Paynter - 2002
110 Concurrent Reading and Writing – Leslie Lamport - 1977
56 The Non-Blocking Write Protocol NBW: A Solution to a Real-Time Synchronization Problem – H Kopetz, J Reisinger - 1993
2 Cooperating Sequential Processes (Techniche Hogeschool – E W Dijkstra - 1965
2 Proof of a Mutual Exclusion Algorithm - A `class'ic example – M Hofri - 1990
2 Another Solution of the Mutual Exclusion Problem – T Kowalttowski, A Palma - 1984
8 Infeld L The Evolution of Physics: the Growth of Ideas from Early Concepts to Relativity and Quanta (New York: Simon and – A Einstein - 1938
94 How to solve it: a new aspect of mathematical method – G Polya - 1945
2 A criteron for atomicity – J H Anderson, M G Gouda - 1992
12 Counterexamples to a one writer multireader atomic shared variable construction of Burns and Peterson – S Haldar, K Vidyasankar
22 An Overview of Formal Verification for the Time-Triggered Architecture – John Rushby - 2002
40 How to construct an atomic variable – J TROMP - 1989
3 Quantitative languages – A Henzinger
7 Role Model Analysis of an Asynchronous Communication Mechanism – H R Simpson - 1997