Deadlock Avoidance Revisited

Journal of the ACM (JACM)

Volumn 29, Issue 4, 1982, Pages 1023-1048

  Minoura, Toshimi ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

NP complete; PSPACE complete

Indexed keywords

COMPUTER OPERATING SYSTEMS;

EID: 0020190993     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322344.322351     Document Type: Article

References (26)

1. Aho, A. V., Hopcroft, J.E., And Ullman, J.D. The Design And Analysis Of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Chandra, A.K., Kozen, D.C., And Stockmeyer, L.J. Alternation. ACM 28, 1 (Jan. 1981), 114-133.
3. Chu, W.W., And Ohlmacher, G. Avoiding Deadlock In Distributed Data bases. Proc. ACM Ann. Coni., San Diego, Calif., Nov. 1974, pp. 156-160.
4. Coffman, E.G., Elphick, M.J., And Shoshani, A. System deadlocks. Comput. Surv. 3,2 (June 1971), 67-78.
5. Divtilers, R. Game Interpretation Of The Deadlock avoidance problem. Commun. A CM 20,10 (Oct. 1977), 741-745.
6. Eswaran, K.P., Gray, J.N., Lorie, R.A., And Trajger, I.L. The notions of consistency and predicate locks in a database system. Commun. ACM 19, 11 (Nov. 1976), 624-633.
7. Eve, S., And Tarjan, R.E. A combinatorial problem which is complete in polynomial space. J. ACM 23, 4 (Oct. 1976), 710-719.
8. Gligor, V.D., And Shattuck, S.H. On Deadlock Detection In distributed systems. IEEE Trans. Softw. Eng. SE-6, 5 (Sept. 1980), 435-440.
9. Gold, E.M. Deadlock prediction: Easy and difficult cases. SIAM J. Comput. 7, 3 (Aug. 1978), 320-336.
10. Gray, J. Notes on data base operating systems. In Operating Systems: An Advanced Course, Lecture Notes in Computer Science 60, Springer-Verlag, New York, 1978, pp. 393-481.
11. Habermann, A.N. Prevention of system deadlocks. Commun. ACM 12,7 (July 1969), 373-377.
12. Ha Vender, J.W. Avoiding deadlock m multitasking systems. IBM Syst. J. 7, 2 (1968), 74-84.
13. Hebalkar, P.G. Coordinated sharing of resources in asynchronous systems. Proc. ACM-MAC Conf on Concurrent Systems and Parallel Computation, June 1970, pp. 151-168.
14. Holt, R.C. Comments on prevention of system deadlocks. Commun. ACM 14,1 (Jan. 1971), 36-38.
15. Holt, R.C. Some deadlock properties of computer systems. Comput. Surv. 4, 3 (Sept. 1972), 179-196.
16. Kameda, T. Testing deadlock-freedom of computer systems. J. ACM 27, 2 (Apr. 1980), 270-280.
17. Kung, H.T., And Pafadimitriou, C.H. An optimality theory of concurrency control for databases. Proc. ACM-SIGMOD Int. Conf. on Management of Data, Boston, Mass., 1979, pp. 116-126.
18. Menasce, D.A., And Muntz, R R. Locking and deadlock detection in distributed data bases. IEEE Trans. Softw. Eng. SE-5, 3 (May 1979), 195-202.
19. Murphy, J.E. Resource Allocation With interlock detection in a multitask system. Proc. I96S FJCC. AFIPS Press, Arlington, Va., 1968, pp 1169-1176
20. Pahnas, D.L., And Habermann, A.N. Comment on deadlock prevention method. Commun. ACM 15, 9 (Sept. 1972), 840-841.
21. Russell, R.D. A Model for deadlock-free resource allocation Ph.D. Dissertation, Dep. of Computer Science, Stanford Univ., Stanford, Calif, May 1972.
22. Schaefer, T.J. Complexity of decision problems based on finite two-person perfect-information games. Proc. 8th Ann. ACM Symp. on Theory of Computing, Hershey, Pa., 1976, pp. 41-49.
23. Shoshani, A., And Cokfman, E G. JR. Sequencing tasks M multiprocess systems to avoid deadlocks. Proc. 11th Ann. IEEE Symp. on Switching and Automata Theory, 1970, pp. 225-235.
24. Stockmeyer, L.J., And Meybr, A.R. Word problems requiring exponential time: Preliminary report. Proc. 5th Ann. ACM Symp. on Theory of Computing, Austin, Texas, 1973, pp. 1-9.
25. Sugiyama, Y., Araki, T., Okui, J., And Kasami, T. Complexity of the deadlock avoidance problem. Trans. Inst, of Electron. Comm. Eng. Japan J60-D, 4 (Apr. 1977), 251-258 (in Japanese).
26. Yannajcakis, M., Papadimitriou, C., And Kuno, H.T. Locking policies: Safety and freedom from deadlock. Proc. 20th Ann. IEEE Symp. on Foundations of Computer Science, San Juan, Puerto Rico, 1979, pp. 286-297.