Results about fast mutual exclusion

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 1992, Pages 12-21

  Alur, Rajeev ^a   Taubenfeld, Gadi ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSENSUS ALGORITHMS; CRITICAL SECTIONS; LINEAR FUNCTIONS; MUTUAL EXCLUSION ALGORITHMS; MUTUAL EXCLUSIONS; PROCESS NEEDS; SHARED MEMORY; TIME COMPLEXITY;

REAL TIME SYSTEMS;

ALGORITHMS;

EID: 84880879693     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/REAL.1992.242680     Document Type: Conference Paper

References (15)

1. [ADLS91] H. Attiya, C. Dwork, N. Lynch, and L. Stock-meyer. Bounds on the time to reach agreement in the presence of timing uncertainty. In Proc. 23rd ACM Symp. on Theory of Computing, pages 359-369, May 1991.
2. [AL89] H. Attiya and N. Lynch. Time bounds for realtime process control in the presence of timing uncertainty. Proceedings of the 10th Real-Time Systems Symposium, pp. 268-284, December 1989.
3. [AGMT91] Y. Afek, E. Garni, M. Merritt, and G. Tauben-feld. Contention sensitive mutual exclusion. In preparation, 1991.
4. [Dij65] E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of ACM, 8(9), 1965.
5. [Fis83] M. J. Fischer. The consensus problem in unreliable distributed systems (a brief survey). In M. Karpin-sky, editor, Foundations of Computation Theory, pages 127-140. Lecture Notes in Computer Science, vol. 158, Springer-Verlag, 1983.
6. [FLP85] M. J. Fischer, N. A. Lynch, and M. S. Pater-son. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, April 1985.
7. [Lam87] L. Lamport. A fast mutual exclusion algorithm. ACM Trans, on Computer Systems, 5(1):1-11, 1987.
8. [LA87] C. M. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163-183, 1987.
9. [LS92] N. Lynch and N. Shavit. Timing-based mutual exclusion. Proceedings of the 13th Real-Time Systems Symposium. To appear.
10. [Mac91] M. R. MacBlane. Source level atomic test-and-set for the TUXEDO System source product. UNIX System Laboratories, May 14, 1991.
11. [MP91] Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent systems. Springer-Verlag, 1991.
12. [MT91] M. Merritt and G. Taubenfeld. Speeding Lamport's fast mutual exclusion algorithm. AT&T Technical Memorandum, May 1991.
13. [OG76] S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Inf., 6(4), 1976.
14. [OL82] S. Owicki and L. Lamport. Proving liveness properties of concurrent programs. ACM Transactions on Programming Languages and Systems, 4(3), 1982.
15. [TUX90] TUXEDO System Release 4.0-Product Overview. AT&T, 1990.