Timing-based mutual exclusion

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 1992, Pages 2-11

  Lynch, Nancy ^a   Shavit, Nir ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL REGION; DEADLOCK-FREE; LARGE-SCALE APPLICATIONS; MUTUAL EXCLUSION ALGORITHMS; MUTUAL EXCLUSIONS; READ/WRITE REGISTERS;

COMPUTER NETWORKS; ELECTRICAL ENGINEERING;

REAL TIME SYSTEMS;

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

References (20)

1. M. R. MacBlane. Source level atomic test-and-set for the TUXEDO system source product. UNIX System Laboratories, May 14, 1991
2. TUXEDO System Release 4.0-Product Overview. AT&T, 1990.
3. J. Burns and N. Lynch. Mutual exclusion using indivisible reads and writes. In Proceedings of 18th Annual Allerton Conference on Communications, Control and Computing, 1989, pages 833-842.
4. E. Styer. Improving fast mutual exclusion. Manuscript.
5. M. Merritt and G. Taubenfeld. Speeding Lamport's fast mutual exclusion algorithm. Manuscript.
6. R. Alur and G. Taubenfeld. Results about fast mutual exclusion In Proceedings of Real Time Systems Symposium, Pheonix, Arizona, 1992.
7. M. Merritt, F. Modugno and M. Tuttle. Time-Constrained Automata. In Proceedings of 2nd CONCUR, Amsterdam, The Netherland, August, 1991, Springer-Verlag LNCS 527, pp. 408-423.
8. N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th PODC, August 1987, pp. 137-151.
9. N. Lynch and M. Tuttle. An introduction to Input/Output Automata. CWI-Quarterly, No. 3, Vol. 2, September, 1989, pp. 219-246
10. M. Fischer. Personal communication.
11. F. Fich. Personal communication.
12. N. Lynch and F. Vaandrager. Forward and backward simulations for timing-based systems. In Proceedings of REX Workshop "Real-Time: Theory in Practice," Mook, The Netherland, 1992. Springer-Verlag LNCS 600.
13. N. Lynch and I. Saias. Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, 1992.
14. E. Kushilevits and M. Rabin. Randomized mutual exclusion algorithms revisited. In Proceedings of the 11th PODC, 1992.
15. E.W. Dijkstra. Solution of a problem in concurrent programming control. Communications Of The ACM, 8:165, 1965.
16. H. Katseff. A new solution to the critical section problem. In Proceedings of the 10"* Annual ACM Symposium on Theory of Computing, pages 86-88. ACM, 1978.
17. L. Lamport. A fast mutual exclusion algorithm. ACM Trans, on Comp. Systems, 5(1):1-11, Feb. 87.
18. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Communications of the ACM, 78(8):453-455, 1974.
19. M. Abadi and L. Lamport. An old fashioned Recipe for Real Time In Real Time: Theory in Practice, REX Workshop, Springer Verlag, pp. 1-27, 1991.
20. H. Attiya and N. Lynch. Time bounds for real-time process control in the presence of timing uncertainty. In Proceedings of the 10th RTSS, Santa-Monica, December 1989, pp. 268-284.