| Mixed solutions for the deadlock problem |
| Full text |
Pdf
(471 KB)
|
Source
|
Communications of the ACM
archive
Volume 16 , Issue 7 (July 1973)
table of contents
Pages: 427 - 430
Year of Publication: 1973
ISSN:0001-0782
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 14, Downloads (12 Months): 48, Citation Count: 7
|
|
|
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
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
| |
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.
|
 |
4
|
|
| |
5
|
Habermann, A.N. Comments made at the Third Annual Symposium on Operating System Principles, Palo Alto, Calif., Oct. 1971.
|
 |
6
|
|
| |
7
|
Havender, J.W. Avoiding deadlock in multi-tasking systems. IBM Syst. J. 2 (1968), 74-84.
|
| |
8
|
|
| |
9
|
Hoare, C.A.R. Towards a theory of parallel programming. In International Seminar on Operating Systems Techniques. Academic Press, New York 1972.
|
 |
10
|
|
CITED BY 7
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Michel E. Adiba , Jean-Claude Chupin , Robert Demolombe , Georges Gardarin , Jean Le Bihan, Issues in distributed data base management systems: a technical overview, Proceedings of the fourth international conference on Very Large Data Bases, p.89-110, September 13-15, 1978, West Berlin, Germany
|
|
|
|
|