摘要: Several examples of deadlock occurring in present day computer systems are given Next, there is a discussion the strategms which can be ~sed to deal with problem A theory developed so that terms "process" and "deadlock" defined. "Reusable resources" introduced model objects shared among processes, "consumable signals or messages passed processes. Then rumple graph m developed, its propertms investigated This unifies number previous results, leads efficient detection prevenUon algorithms, ~s useful for teaching purposes.
acm.org
sci-hub.se 参考文章(17)
Richard Craig Holt, On deadlock in computer systems Cornell University. ,(1971)
Claude Berge, Alison Doig, The theory of graphs ,(1962)
Robert David Russell, A model for deadlock-free resource allocation Stanford University. ,(1972)
Jerome Howard Saltzer, Traffic control in a multiplexed computer system Massachusetts Institute of Technology. ,(1966)
R. L. Rappaport, IMPLEMENTING MULTI-PROCESS PRIMITIVES IN A MULTIPLEXED COMPUTER SYSTEM Massachusetts Institute of Technology. ,(1968)
Edsger W. Dijkstra, Cooperating sequential processes The origin of concurrent programming. pp. 65- 138 ,(2002) , 10.1007/978-1-4757-3472-0_2
C. J. Conti, D. H. Gibson, S. H. Pitkowsky, Structural aspects of the system/360 model 85: I general organization Ibm Systems Journal. ,vol. 7, pp. 2- 14 ,(1968) , 10.1147/SJ.71.0002
Per Brinch Hansen, None, The nucleus of a multiprogramming system Communications of the ACM. ,vol. 13, pp. 238- 241 ,(1970) , 10.1145/362258.362278
J. W. Havender, Avoiding deadlock in multitasking systems Ibm Systems Journal. ,vol. 7, pp. 74- 84 ,(1968) , 10.1147/SJ.72.0074
Edsger W. Dijkstra, The structure of the “THE”-multiprogramming system Communications of The ACM. ,vol. 11, pp. 341- 346 ,(1968) , 10.1145/363095.363143