System Deadlocks

ACM Computing Surveys (CSUR)

Volumn 3, Issue 2, 1971, Pages 67-78

  Coffman, E G ^a   Elphick, M ^b   Shoshani, A ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

^c Unisys   (United States)

Author keywords

deadlocks; deadly embraces; interlock problems; multiprograrnming; system deadlocks

Indexed keywords

EID: 84976691730     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356586.356588     Document Type: Article

References (18)

1. Dijkstra, E. W. “Co-operating sequential processes.” In Programming languages: NATO advanced study institute. F. Genuys (Ed.), Academic Press, London. 1968.
2. IBM System/360 operating system, supervisor and data management services. Form C28-6646-2. IBM, White Plains, N. Y., 1968.
3. Dennis, J. B.; and Van Horn, E. C. “Programming semantics for multiprogrammed computations.” Comm. ACM 9, 3 (March 1966), 143-155.
4. Havender. J. W. “Avoiding deadlock in multi-tasking systems.” IBM Systems Journal 2 (1968), 74-84.
5. BRAUDE, E. J. “An algorithm for the detection of system deadlocks.” IBM Technical Report: TROO. 791, IBM Data Systems Division, Poughkeepsie, N. Y., 1961.
6. Collier, W. W. “System deadlocks.” IBM Technical Report TR-00. 1756, IBM Systems Development Division, Poughkeepsie, N.Y., 1968.
7. Reiter, A. “A resource-allocation scheme for multi-user on-line operation of a small computer.” Proc. AFIPS SJCC, Vol. 30, pp. 1-7. AFIPS Press. Montvale, N. J., 1967.
8. Murphy, J. E. “Resource allocation with interlock detection in a multi-task system.” Proc. AFIPS FJCC, Vol. 33, Pt. 2, pp. 1169-1176. AFIPS Press, Montvale, N.J., 1968.
9. Merikallio. R. A.; and Holland, F. C. “Simulation design of a multi-processing system.” Proc. AFIPS FJCC, Vol. 33, Pt. 2. pp. 1399-1410. AFIPS Press, Montvale, N. J., 1968.
10. Shoshani, A.; and Coffman, E. G. “Sequencing tasks in multi-process, multiple resource systems to avoid deadlocks.” In Proc. 11th Annual Symposium on Switching and Automata Theory, Oct. 1970. pp. 225-233.
11. Habermann, A. N. “Prevention of system deadlocks.” Comm. ACM 12, 7 (July 1969), 373-377, 385.
12. Needham, R. M.; and Hartley. D. F. “Theory and practice in operating system design.” Proc. 2nd ACM Symposium on Operating Systems Principles, pp. 8-12. Brandon/Systems Press. Princeton, N.J., 1969.
13. Shoshani. A.; and Bernstein, A. J. “Synchronization in a parallel-accessed data base.” Comm. ACM 12, 11 (Nov. 1969), 604-607.
14. Shoshani, A.; and Coffman. E. G. “Prevention, detection, and recovery from system deadlocks.” In Proc. 4th Annual Princeton Conf. on Information Sciences and Systems, March 1970.
15. Dijkstra, E. W. “The structure of the THE multiprogramming system.” Comm. ACM 11, 5 (May 1968), 341-346.
16. Holt, Richard C. “On deadlock in computer systems.” (PhD Dissertation) Department of Computer Science. Cornell University, Ithaca, N.Y., Jan. 1971.
17. Russell, R. D. “A model of deadlock-free resource allocation—preliminary version.” Memo CGTM #93, Department of Computer Science, Stanford University, Stanford, Calif., June 1970.
18. Hebalkar, Prakash. “Deadlock-free resource sharing in asynchronous systems.” (PhD Dissertation) Electrical Engineering Department. MIT. Cambridge, Mass., Sept. 1970.