论文信息 - System Deadlocks

System Deadlocks

A problem of increasing importance in the design of large multiprogramming systems is the, so-called, deadlock or deadly-embrace problem. In this article we survey the work that has been done on the treatment of deadlocks from both the theoretical and practical points of view.

[1] Edward G. Coffman,et al. Sequencing tasks in multiprocess, multiple resource systems to avoid deadlocks , 1969 .

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

[3] Arie Shoshani,et al. Synchronization in a parallel-accessed data base , 1969, CACM.

[4] Richard Craig Holt,et al. On deadlock in computer systems , 1971 .

[5] Edsger W. Dijkstra,et al. The structure of the “THE”-multiprogramming system , 1968, CACM.

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

[7] Jack B. Dennis,et al. Programming semantics for multiprogrammed computations , 1966, CACM.

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

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

[10] Roger M. Needham,et al. Theory and practice in operating system design , 1969, SOSP '69.

[11] Edsger W. Dijkstra,et al. Co-operating sequential processes , 1968 .

[12] Allen Reiter. A resource-allocation scheme for multi-user on-line operation of a small computer , 1967, AFIPS '67 (Spring).

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