Some Deadlock Properties of Computer Systems

ACM Computing Surveys (CSUR)

Volumn 4, Issue 3, 1972, Pages 179-196

  Holt, Richard C ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

deadlock; deadly embrace; graph reduction; interlock; knot; operating system; pre empuon; resource allocation

Indexed keywords

COMPUTER OPERATING SYSTEMS;

EID: 0015397034     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356603.356607     Document Type: Article

References (21)

1. Atwood, J W; Clark, B L; Grushcow, M S., Holt, R. C.; Horning, J J.; Sevcik, K. C.; and Tsichritzis, D “Project SUE status report.” Computer Systems Research Group, Technical Report CSRG-11, Univ Toronto, Toronto, Ontario, Canada, April 1972.
2. Berge, Claude. The theory of graphs John Wiley & Sons, New York, 1962 (originally published in French in 1958).
3. Hansen, Per Brinch “The nucleus of a multiprogramming system” Comm ACM 13, 4 (April 1970), 238-241, 250.
4. Coffman, E. G.; Elphick, M. J.; and Shoshani, A. “System deadlocks.” Computing Surveys 3, 2 (June 1971), 67-78.
5. Dijkstra, E. W. “Cooperating sequential processes.” Technological Univ, Eindhoven, The Netherlands, Sept. 1965.
6. Dijkstra, E. W. “The structure of the “The” multiprogramming system” Comm. ACM 11, 5 (May 1968), 341-346.
7. Dryer, Matthew. “User's manual for Topps.” Computer Systems Research Group, Univ Toronto, Toronto, Ontario, Canada, 1972.
8. Habermann, A N. “Prevention of system deadlocks.” Comm ACM 12, 7 (July 1969), 373-377, 385.
9. Havender, J W “Avoiding deadlock in multitasking systems.” IBM Systems J. 7, 2 (1968), 74-84.
10. Holt, A W., AND Commoner, F. “Events and conditions” Record of the project MAC conference on concurrent systems and parallel computation, ACM, June 1970, 3-52
11. Holt, Richard C. “On deadlock an computer systems.” PhD Thesis, Cornell Univ, Ithaca, NY, Jan 1971 (Reproduced as CSRG Tech-meal Report 6, Dept Computer Science, Univ. Toronto, Toronto, Ontario, Canada)
12. Horning, J J., and Randell, B. “Structuring complex processes.” Report RC2459, IBM Research Lab., Yorktown Heights, N.Y, May 1969
13. Karp, Richard M.; and Miller, Raymond E. “Parallel program schemata.” J Computer & System Sciences 3, 2 (May 1969), 147-195.
14. Lampson, B. W. “A scheduling philosophy for multiprocessing systems” Comm. ACM 11, 5 (May 1968), 347-360.
15. Mckeag, R M “The multiprogramming system.” Queen's Univ. Belfast, Dept. Computer Science, Belfast, N. Ireland, 1972.
16. Murphy, J E. “Resource allocation with interlock detection in a multitask system” In Proc. AFIPS 1968 Fall Joint Computer Conf., Vol. 33, Pt 2, AFIPS Press, Montvale, N J., 1169-1176.
17. Rappaport, Robert L “Implementing multi process primitives in a multiplexed computer system” Masters Thesis. Dept Electrical Engineering (Project MAC), Massachusetts Institute Technology, Cambridge, Mass, Nov. 1968.
18. Russell, R D “A model of deadlock-free resource allocation.” PhD Thesis, Dept. Computer Science, Stanford Univ, Stanford, Calif, July 1971
19. Saltzer, Jerome Howard “Traffic control in a multiplexed computer system” PhD Thesis, Project MAC, Massachusetts Institute Technology, Cambridge, Mass, July 1966.
20. Shoshani, A; and Coffman, E G, Jr “Detection, prevention, and recovery from deadlock in multiprocess, multiple resource systems.” Technical Report 80, Computer Sciences Lab, Dept Electrical Engineering, Princeton Univ, Princeton, N J., Oct 1969.
21. Vernerr, Yves “On process communication and process synchronization” Masters Thesis, Dept Computer Science. Univ Toronto, Toronto, Ontario, Canada, Oct 1971.