E. G. Coffman
M. Elphick
Abstract
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.
References
- 1 DIJKSTRA, E. W. "Co-operating sequential processes." In Programming languages: NATO advanced study institute. F. GENUYS (ED.), Academic Press, London. 1968.Google Scholar
- 2 IBM System/360 operating system, ,supervisor and data management services. Form C28-6646- 2, IBM, White Plains, N. Y., 1968.Google Scholar
- 3 DENNIS, J. B.; AND VAN HOnN, E. C. "Programming semantics for multiprogrammed computations." Comm. ACM 9, 3 (March 1966), 143-155. Google Scholar
- 4 HAVENDER. J. W. "Avoiding deadlock in multi-tasking systems." IBM Systems Journal 2 (1968), 74-84.Google Scholar
- 5 BRAUOE, E. J. "An algorithm for the detection of system deadlocks." IBM Technical Report: TROO. 791, IBM Data Systems Division, Poughkeepsie, N. Y., 1961.Google Scholar
- 6 COLLIER, W. W. "System deadlocks." IBM Technical Report TR-00. 1756, IBM Systems Development Division, Poughkeepsie, N.Y., 1968.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 9 MERIKALLIO. R. A.; AND HOLLAND, F. C. "Sinnllation design of a multi-processing system." Proc. AFIPS FJCC, Vol. 33, Pt. 2, pp. 1399-1410. AFIPS Press, Montvale, N. J., 1968.Google Scholar
- 10 SHOSHANI, A.; AND COFFMAN, E.G. "Sequencing tasks in multi-process, multiple resource systems lo avoid deadlocks." In Proc. 11th Annual Symposium on Switching and Automata Theory, Oct. 1970. pp. 225-233.Google Scholar
- 11 HABERMANN, A. N. "Prevention of system deadlocks." Comm. ACM 12, 7 (July 1969), 373-377. 385. Google Scholar
- 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. Google Scholar
- 13 SHOSHANL A.; AND BERNSTEIN, A. J. "Synchronization in a parallel-accessed data base." Comm. ACM 12, 11 (Nov. 1969), 604-607 {Also GE Report No. 69-C-138}. Google Scholar
- 14 SHOSHANI A.; AND COFFMAN. E. G. "Prevention, detection, and recovery from system deadlocks." In Proc. 4th Annual Princeton Conf. on Information Sciences alul Sgstems, March 1970. (See also Computer Science Lab. Technical Report No. 80, Department of Electrical Engineering. Princeton University, 1969.)Google Scholar
- 15 DIJKSTRA, E.W. "The structure of the THE- multiprogramming system." Comm. ACM 11, 5 (May 1968), 341-346. Google Scholar
- 16 HOLT, RICHARD C. "On deadlock in compuler systems." (PhD Dissertation) Department of Computer Science. Cornell University, Ithaca, N.Y., Jan. 1971. Google Scholar
- 17 RUSSELL, R.D. "A model of de'tdlock-free resource allocation--preliminary version." Memo CGTM #93. Department of Computer Science, Stanford University, Stanford, Calif., June 1970.Google Scholar
- 18 HEBALKAR, PRAKASH. "Deadlock-free resource sharing in asynchronous systems." (PhD Dissertation) Electrical Engineering Department, MIT, Cambridge, Mass., Sept. 1970.Google Scholar
Comments