The Deadlock problem: a classifying bibliography

The desire for a better utilisation of resources and an acceleration of computing introduced the concept of parallelism with all its difficulties. Soon the danger of eternal delays of processes was discovered and called deadlock. For almost twenty years a lot of publications have dealt with problems considering deadlocks or their environment.Here we want to give a classification of our collected publications. We do not claim that this collection is complete in any sense, but we hope to have found essential articles (underlined) for nearly all the different topics fitting under the title "Deadlock".This classification regards different aspects of the problem and cannot always be given unambigiously so that many publications are listed several times. We would appreciate to get knowledge of other interesting articles or textbooks to this theme.

[1]  C. V. Ramamoorthy,et al.  Protocols for Deadlock Detection in Distributed Database Systems , 1982, IEEE Transactions on Software Engineering.

[2]  William B. Pennebaker,et al.  Electrical properties of RF sputtering systems , 1979 .

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

[4]  Richard C. Holt,et al.  Some Deadlock Properties of Computer Systems , 1972, CSUR.

[5]  Gerard J. Holzmann.  A Theory for Protocol Validation , 1982, IEEE Transactions on Computers.

[6]  David B. Lomet.  A practical deadlock avoidance algorithm for data base systems , 1977, SIGMOD '77.

[7]  Werner Kießling,et al.  A Quantitative Comparison , 2009 .

[8]  A. Nico Habermann.  A new approach to avoidance of system deadlocks , 1974, Symposium on Operating Systems.

[9]  Vijay Ahuja,et al.  Determining Deadlock Exposure for a Class of Store and Forward Communication Networks , 1980, IBM J. Res. Dev..

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

[11]  Alfred Z. Spector,et al.  Transactions: a construct for reliable distributed computing , 1983, OPSR.

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

[13]  David B. Lomet.  Subsystems of Processes with Deadlock Avoidance , 1980, IEEE Transactions on Software Engineering.

[14]  Toshihide Ibaraki,et al.  Deadlock-Free Systems for a Bounded Number of Processes , 1982, IEEE Transactions on Computers.

[15]  John H. Howard.  Mixed solutions for the deadlock problem , 1973, CACM.

[16]  Arno Zeyn,et al.  Algorithmen zur Deadlock-Vermeidung , 1976 .

[17]  Daniel R. Ries,et al.  Nested Transactions in Distributed Systems , 1982, IEEE Transactions on Software Engineering.

[18]  Glen E. Newton.  Deadlock prevention, detection, and resolution: an annotated bibliography , 1979, OPSR.

[19]  Ashok K. Agrawala,et al.  An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.

[20]  Abraham Silberschatz,et al.  On the generalized critical region construct , 1982, OPSR.

[21]  Jörg Hofmann,et al.  Performance Analysis of Suspend Locks in Operating Systems , 1982, IBM J. Res. Dev..

[22]  Abraham Silberschatz,et al.  A Family of Locking Protocols for Database Systems that Are Modeled by Directed Graphs , 1982, IEEE Transactions on Software Engineering.

[23]  Sam Toueg,et al.  Deadlock- and livelock-free packet switching networks , 1980, STOC '80.

[24]  Sam Toueg,et al.  The design of deadlock- and livelock-free packet switching networks , 1979 .

[25]  Virgil D. Gligor,et al.  On Deadlock Detection in Distributed Systems , 1980, IEEE Transactions on Software Engineering.

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

[27]  Christos H. Papadimitriou.  Theory of concurrency control , 1983 .

[28]  Murat Mehmet Tanik.  A graph model for deadlock prevention. , 1978 .

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

[30]  Eugene W. Stark.  Semaphore primitives and starvation-free mutual exclusion , 1982, JACM.

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

[32]  Rafael O. Fontao.  A concurrent algorithm for avoiding deadlocks in multiprocess multiple resource systems , 1971, SOSP '71.

[33]  Christos H. Papadimitriou.  A theorem in database concurrency control , 1982, JACM.

[34]  Tiko Kameda,et al.  A polynomial-time test for the deadlock-freedom of computer systems , 1977, Theoretical Computer Science.

[35]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

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

[37]  Raymond R. Devillers,et al.  A General Mechanism for Avoiding Starvation with Distributed Control , 1978, Inf. Process. Lett..

[38]  M. Malik,et al.  Operating Systems , 1992, Lecture Notes in Computer Science.

[39]  Henry F. Korth.  Locking protocols: general lock classes and deadlock freedom , 1981 .

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

[41]  Erol Gelenbe,et al.  On the modeling of parallel access to shared data , 1983, CACM.

[42]  Vijay Ahuja.  Algorithm to Check Network States for Deadlock , 1979, IBM J. Res. Dev..

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

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

[45]  Toshimi Minoura,et al.  Deadlock avoidance revisited , 1982, JACM.

[46]  Yat Sang Kwong.  On reductions and livelocks in asynchronous parallel computation , 1982 .