Deadlock avoidance revisited

Several new algorithms which utilise wait-for relations induced by processes are developed for deadlock avoidance in operating systems. One of the algorithms allows more concurrency than Havender's scheme and Habermann's algorithm; nonetheless, it can still be computed in polynomial time. Further, the deadlock-prediction problem for a set of processes using locks is reduced to a new np-complete problem, and the deadlock-avoidance problem for processes with branches is shown to be pspace-complete. Finally, the relative power of various algorithms is compared. 26 references.

[1]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[2]  James E. Murphy.  Resource allocation with interlock detection in a multi-task system , 1968, AFIPS '68 (Fall, part II).

[3]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[4]  David Lorge Parnas,et al.  Comment on deadlock preventive method , 1972, CACM.

[5]  Prakash G. Hebalkar.  Coordinated sharing of resources in asynchronous systems , 1970 .

[6]  H. T. Kung,et al.  An optimality theory of concurrency control for databases , 1979, SIGMOD '79.

[7]  Tiko Kameda,et al.  Testing Deadlock-Freedom of Computer Systems , 1980, JACM.

[8]  James E. Murphy.  Resource Allocation With Interlock Detection in a Multi-Task System , 1899 .

[9]  W. W. Chu,et al.  Avoiding deadlock in distributed data bases , 1974, ACM '74.

[10]  Mihalis Yannakakis,et al.  Locking policies: Safety and freedom from deadlock , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[11]  Robert David Russell.  A model for deadlock-free resource allocation , 1972 .

[12]  Richard C. Holt,et al.  Comments on prevention of system deadlocks , 1971, Commun. ACM.

[13]  Thomas J. Schaefer,et al.  Complexity of decision problems based on finite two-person perfect-information games , 1976, STOC '76.

[14]  A. Nico Habermann,et al.  Prevention of system deadlocks , 1969, CACM.

[15]  James W. Havender.  Avoiding Deadlock in Multitasking Systems , 1968, IBM Syst. J..

[16]  Arie Shoshani,et al.  System Deadlocks , 1971, CSUR.

[17]  Richard C. Holt,et al.  Some deadlock properties of computer systems , 1971, SOSP '71.

[18]  E. Mark Gold,et al.  Deadlock Prediction: Easy and Difficult Cases , 1978, SIAM J. Comput..

[19]  Arie Shoshani,et al.  Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks , 1970, SWAT.

[20]  Robert E. Tarjan,et al.  A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.

[21]  Daniel A. Menascé,et al.  Locking and Deadlock Detection in Distributed Data Bases , 1979, IEEE Transactions on Software Engineering.

[22]  Raymond R. Devillers.  Game interpretation of the deadlock avoidance problem , 1977, CACM.

[23]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[24]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.