Some Deadlock Properties of Computer Systems
- 1 September 1972
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 4 (3) , 179-196
- https://doi.org/10.1145/356603.356607
Abstract
First, a “meta theory” of computer systems is developed so that the terms “process” and “deadlock” can be defined. Next, “reusable resources” are introduced to model objects which are shared among processes, and “consumable resources” are introduced to model signals or messages passed among processes. Then a simple graph model of computer systems is developed, and its deadlock properties are investigated. This graph model is useful for teaching purposes, unifies a number of previous results, and leads to efficient deadlock detection and prevention algorithms.Keywords
This publication has 6 references indexed in Scilit:
- System DeadlocksACM Computing Surveys, 1971
- The nucleus of a multiprogramming systemCommunications of the ACM, 1970
- Prevention of system deadlocksCommunications of the ACM, 1969
- A scheduling philosophy for multiprocessing systemsCommunications of the ACM, 1968
- The structure of the “THE”-multiprogramming systemCommunications of the ACM, 1968
- Avoiding deadlock in multitasking systemsIBM Systems Journal, 1968