John H. Howard
Abstract
Mixtures of detection, avoidance, and prevention provide more effective and practical solutions to the deadlock problem than any one of these alone. The individual techniques can be tailored for subproblems of resource allocation and still operate together to prevent deadlocks. This paper presents a method, based on the concept of the hierarchical operating system, for constructing appropriate mixtures and suggests appropriate subsystems for the most frequently occurring resource allocation problems
- 1 Coffman, E.G., Elphick, M.J., and Shoshani, A. System deadlocks. Computing Surveys 3, 2 (Feb. 1971), 67-78. Google Scholar
Digital Library
- 2 Holt, R.C. On deadlock in computer systems. Ph.D. Diss. Dept. of Computer Science, Cornell U., Ithaca, N.Y., Jan. 1971. Google ScholarDigital Library
- 3 Shoshani, A., and Coffman, E.G. Prevention, detection, and recovery from system deadlocks. Proc. 4th Ann. Princeton Conf. on Information Science and Systems, Mar. 1970.Google Scholar
- 4 Habermann, A.N. Prevention of system deadlocks. Comm. ACM12, 7 (July 1969), 373-377; 385. Google ScholarDigital Library
- 5 Habermann, A.N. Comments made at the Third Annual Symposium on Operating System Principles, Palo Alto, Calif., Oct. 1971.Google Scholar
- 6 Holt, R.C. Comments on prevention of system deadlocks. Comm. ACM14, 1 (Jan. 1971), 36-38. Google ScholarDigital Library
- 7 Havender, J.W. Avoiding deadlock in multi-tasking systems. IBM Syst. J. 2 (1968), 74-84.Google ScholarDigital Library
- 8 Howard, J.H. The coordination of multiple processes in computer operating systems. Ph.D. Diss. Department of Computer Sciences, U. of Texas, Austin, Tex., Dec. 1970. Google ScholarDigital Library
- 9 Hoare, C.A.R. Towards a theory of parallel programming. In International Seminar on Operating Systems Techniques. Academic Press, New York 1972.Google ScholarCross Ref
- 10 Dijkstra, E.W. The structure of the THE-multiprogramming system. Comm. ACM 11, 5 (May 1968), 341-346. Google ScholarDigital Library
Recommendations
Deadlock Detection and Avoidance for Shared Logical Resources
Logical resources are defined as shared passive entities that can be concurrently accessed by multiple processes. Concurrency restrictions depend upon the mode or manner in which a process may manipulate a resource. Models incorporating these single ...
Deadlock Prediction: Easy and Difficult Cases
The subject of this paper is the computational complexity of the deadlock prediction problem for resource allocation. This problem is the question “Is deadlock avoidable?” i.e. “Is there a feasible sequence in which to allocate all the resource requests?” ...
Comments on prevention of system deadlocks
Habermann's method of deadlock prevention is discussed, where deadlock is defined as a system state from which resource allocations to certain processes are not possible. It is shown that the scheduler may introduce “artificial” deadlocks which ...
Comments